A new algorithm for enumerating all maximal cliques in complex network

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4093 LNAI, Issue , 2006, Pages 606-617

  Wan, Li ^a   Wu, Bin ^a   Du, Nan ^a   Ye, Qi ^a   Chen, Ping ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SYSTEMS PROGRAMMING; PROGRAM PROCESSORS; TELECOMMUNICATION SYSTEMS; DATA MINING;

CHURN PREDICTION SYSTEMS; COMPLEX NETWORKS; MAXIMAL CLIQUES; VERTEX; ALL MAXIMAL CLIQUES; CHURN PREDICTIONS; CLUSTERING COEFFICIENT; CUSTOMER CHURN PREDICTION; MAXIMAL CLIQUE; MAXIMUM DEGREE; NETWORK PROPERTIES; NUMBER OF TRIANGLES;

LARGE SCALE SYSTEMS; COMPLEX NETWORKS;

EID: 33749407160     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11811305_67     Document Type: Conference Paper

References (19)

1. D.S. Johnson, M. Yanakakis and C.H. Papadimitriou On generating all maximal independent sets, Info. Proc. Lett., 27 (1988) 119 - 123
2. R. C. Read and R. E. Tarjan, Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks, 5(1975) 237-252
3. S. Tsukiyama, M. Ide, H. Ariyoshi and I. Shirakawa, A new algorithm for generating all the maximal independent sets, SIAM J. Comput., 6(1977) 505-517
4. T. Eiter and K. Makino, On computing all abductive explanations, Proc. AAAI '02, AAAI Press, pp.62 - 67, 2002
5. B. Selman and H. J. Levesque, Support set selection for abductive and default reasoning, Artif. Int., 82(1996) 259 - 272
6. R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases, Proc. VLDB '94, pp.487 - 499, 1994.
7. R. Agrowal, H. Mannila, R. Srikant, H. Toivonen and A.I. Verkamo, Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, MIT Press, pp. 307-328, 1996.
8. S. R. Kumar, P. Raghavan, S.Rajagopalan, and A. Tomkins, Trawling the web for emerging cyber-communities, Proc. the Eighth International World Wide Web Conference, Toronto, Canada, 1999.
9. Faisal N. Abu-Khzam, Nicole E. Baldwin, Michael A. Langsten and Nagiza F. Samatova On the relative efficiency of maximal clique enumeration algorithms, with application to High-Throughput computational biology. Proceedings, International Conference on Research Trends in Science and Technology, Beirut, Lebanon, 2005
10. I. Bomze, M. Budinich, P. Pardalos, and M. Pelillo, "The maximum clique problem," in Handbook of Combinatorial Optimization, vol. 4, D.-Z. Du and P. M. Pardalos, Eds.: Kluwer Academic Publishers, 1999).
11. Patric R. J. A fast algorithm for the maximum clique problem,Discrete Applied Mathematics 120 (2002) 197-207
12. Etsuji Tomita and Tomokazu Seki An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique DMTCS 2003, pp. 278-289, 2003.
13. Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi, The worst-case time complexity for generating all maximal cliques, COCOON 2004, LNCS 3106, pp.161 - 170, 2004.
14. C. Bron and J. Kerbosch, Algorithm 457: Finding all cliques of an undirected graph, Proceedings of the ACM, vol. 16(9), 1973, 575-577.
15. S.Tsukiyama,H.Ariyoshi, I.Shirakawa, A New Algorithm for Generating all the Maximal Independent sets, SIAM J. COMPUT. Vol. 6. No.3, September 1977.
16. Kazuhisa Makino, Takeaki Uno, New Algorithms for Enumerating All Maximal Cliques, SWAT 2004, pp.260 - 272, 2004.
17. F. Kose, W. Weckwerth, T. Linke, and O. Fiehn, Visualizing plant metabolomic correlation networks using clique-metabolite matrices, Bioinformatics, vol. 17, 2001, 1198-1208.
18. Wang Yanhui, Wu Bin, Wang Bai, Research on Static Measures of Telecom Society Network (in Chinese), COMPLEX SYSTEMS AND COMPLEXITY SCIENCE 2005 Vol.2 No.2
19. Lise Getoor, Christopher P.Diehl, Link Mining: A Survey, Newsletter of the ACM Special Interest Group on Knowledge Discovery and Data Mining, December 2005. Volume 7, Issue 2.