A parallel algorithm for enumerating all maximal cliques in complex network

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 320-324

  Du, Nan ^a   Wu, Bin ^a   Xu, Liutong ^a   Wang, Bai ^a   Pei, Xin ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA MINING; GRAPH THEORY; PARALLEL ALGORITHMS;

ALL MAXIMAL CLIQUES; COMPUTATION TIME; HIGH-EFFICIENCY; MASSIVE DATA; MAXIMAL CLIQUE; PERFORMANCE STUDY; REAL-WORLD SCENARIO; RECENT RESEARCHES;

COMPLEX NETWORKS;

EID: 43749119258     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icdmw.2006.17     Document Type: Conference Paper

References (14)

1. R. Milo, Network Motifs: Simple Building Blocks of Complex Networks, Science (2002), 824
2. M. E. J. Newman, The structure and function of complex networks, 2003 Society for Industrial and Applied Mathematics
3. D.S. Johnson, On generating all maximal independent sets, Info. Proc. Lett., 27 (1988) 119-123
4. T. Eiter and K. Makino, On computing all abductive explanations, Proc. AAAI '02, AAAI Press, pp.62-67, 2002
5. R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases, Proc. VLDB '94, 1994.
6. Faisal N. Abu-Khzam, 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
7. Etsuji Tomita, The worst-case time complexity for generating all maximal cliques, COCOON 2004, LNCS 3106, 2004.
8. C. Bron and J. Kerbosch, Algorithm 457: Finding all cliques of an undirected graph, Proceedings of the ACM, vol. 16, 1973
9. S.Tsukiyama, A New Algorithm for Generating all the Maximal Independent sets, SIAM J. COMPUT. Vol. 6. 1977.
10. Kazuhisa Makino, Takeaki Uno, New Algorithms for Enumerating All Maximal Cliques, SWAT 2004
11. F. Kose, Visualizing plant metabolomic correlation networks using clique metabolite matrices, Bioinformatics, 2001
12. Jure Leskovec, Jon Kleinberg, Christos Faloutsos, Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations, KDD conference, 2005
13. Kunal Punera, Joydeep Ghosh, CLUMP: A Scalable and Robust Framework for Structure Discovery, icdm conference 2005
14. Jian Pei, Daxin Jiang, Aidong Zhang, On Mining CrossGraph QuasiCliques, KDD conference, 2005