Finding maximal cliques in massive networks by H*-graph

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2010, Pages 447-458

  Cheng, James ^a   Ke, Yiping ^b   Fu, Ada Wai Chee ^b   Yu, Jeffrey Xu ^b   Zhu, Linhong ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

graph; h; h index; massive networks; maximal clique enumeration; scale free networks

Indexed keywords

EXTERNAL MEMORY ALGORITHMS; FUNDAMENTAL PROBLEM; INPUT GRAPHS; LARGE GRAPHS; LARGE NETWORKS; MAXIMAL CLIQUE; MEMORY SPACE; MEMORY USAGE; NETWORK GRAPH; RANDOM ACCESS; SCALE FREE NETWORKS; SOCIAL NETWORK ANALYSIS;

BIOINFORMATICS; ELECTRIC NETWORK ANALYSIS; GRAPH THEORY;

INDEXING (OF INFORMATION);

EID: 77954713269     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807217     Document Type: Conference Paper

References (29)

1. F. N. Abu-Khzam, N. E. Baldwin, M. A. Langston, and N. F. Samatova. On the relative efficiency of maximal clique enumeration algorithms, with applications to high throughput computational biology. In International Conference on Research Trends in Science and Technology, 2005.
2. E. A. Akkoyunlu. The enumeration of maximal cliques of large graphs. SIAM J. Comput., 2(1):1-6, 1973.
3. H. R. Bernard, P. D. Killworth, and L. Sailer. Informant accuracy in social network data iv: a comparison of clique-level structure in behavioral and cognitive network data. Social Networks, 2(3):191-218, 1979.
4. N. M. Berry, T. H. Ko, T. Moy, J. Smrcka, J. Turnley, and B. Wu. Emergent clique formation in terrorist recruitment. In The AAAI-04 Workshop on Agent Organizations: Theory and Practice, 2004.
5. G. Bianconi and M. Marsili. Emergence of large cliques in random scale-free networks. Europhysics Letters, 74(4):740-746, 2006.
6. V. Boginski, S. Butenko, and P. M. Pardalos. Statistical analysis of financial networks. Computational Statistics & Data Analysis, 48(2):431-443, 2005.
7. C. Bron and J. Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Commun. ACM, 16(9):575-577, 1973.
8. J. M. Byskov. Algorithms for k-colouring and finding maximal independent sets. In SODA, pages 456-457, 2003.
9. F. Cazals and C. Karande. A note on the problem of reporting maximal cliques. Theor. Comput. Sci., 407(1-3):564-568, 2008.
10. G. Creamer, R. Rowe, S. Hershkop, and S. J. Stolfo. Segmentation and automated social hierarchy detection through email network analysis. In WebKDD/SNA-KDD, pages 40-58, 2007.
11. S. N. Dorogovtsev and J. F. F. Mendesand. Evolution of networks: From biological nets to the internet and www. Oxford University Press, 2003.
12. N. Du, B. Wu, L. Xu, B. Wang, and P. Xin. Parallel algorithm for enumerating maximal cliques in complex network. In Mining Complex Data, pages 207-221. 2009.
13. D. Eppstein and E. S. Spiro. The h-index of a graph and its application to dynamic subgraph statistics. In WADS, pages 278-289, 2009.
14. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, pages 251-262, 1999.
15. K. Faust and S. Wasserman. Social network analysis: Methods and applications. Cambridge University Press, 1995.
16. J. E. Hirsch. An index to quantify an individual's scientific research output. Proceedings of the National Academy of Sciences of the United States of America, 102(46):16569-16572, 2005.
17. P. Kilby, J. K. Slaney, S. Thiébaux, and T. Walsh. Estimating search tree size. In AAAI, 2006.
18. D. E. Knuth. Estimating the efficiency of backtrack programs. Mathematics of Computation, 29(129):121-136, 1975.
19. I. Koch. Enumerating all connected maximal common subgraphs in two graphs. Theor. Comput. Sci., 250(1-2):1-30, 2001.
20. F. Kose, W. Weckwerth, T. Linke, and O. Fiehn. Visualizing plant metabolomic correlation networks using clique-metabolite matrices. Bioinformatics, 17(12):1198-1208, 2001.
21. K. Makino and T. Uno. New algorithms for enumerating all maximal cliques. In SWAT, pages 260-272, 2004.
22. N. Modani and K. Dey. Large maximal cliques enumeration in sparse graphs. In CIKM, pages 1377-1378, 2008.
23. S. Mohseni-Zadeh, P. Brézellec, and J.-L. Risler. Cluster-c, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques. Computational Biology and Chemistry, 28(3):211-218, 2004.
24. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167-256, 2003.
25. M. C. Schmidt, N. F. Samatova, K. Thomas, and B.-H. Park. A scalable, parallel algorithm for maximal clique enumeration. J. Parallel Distrib. Comput., 69(4):417-428, 2009.
26. V. Stix. Finding all maximal cliques in dynamic graphs. Computational Optimization and applications, 27:173-186, 2004.
27. E. Tomita, A. Tanaka, and H. Takahashi. The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci., 363(1):28-42, 2006.
28. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa. A new algorithm for generating all the maximal independent sets. SIAM J. Comput., 6(3):505-517, 1977.
29. B. Zhang, B.-H. Park, T. V. Karpinets, and N. F. Samatova. From pull-down data to protein interaction networks and complexes with biological relevance. Bioinformatics, 24(7):979-986, 2008.