A distributed algorithm to enumerate all maximal cliques in MapReduce

4th International Conference on Frontier of Computer Science and Technology, FCST 2009

Volumn , Issue , 2009, Pages 45-51

  Wu, Bin ^a   Yang, Shengqi ^a   Zhao, Haizhou ^a   Wang, Bai ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALL MAXIMAL CLIQUES; CLUSTER SYSTEMS; COMPUTATIONAL CAPACITY; COMPUTING MODEL; DATA SETS; DISTRIBUTED ALGORITHM; DISTRIBUTED PLATFORMS; ENUMERATION ALGORITHMS; LOCAL OPTIMIZATIONS; MAIN TASKS; MAXIMAL CLIQUE; NETWORK SCIENCE; SINGLE CHIPS; STRUCTURE MINING; SUBGRAPHS;

ALGORITHMS; BIOLOGY; CLUSTER COMPUTING; COMPUTER SCIENCE; CONSTRAINED OPTIMIZATION;

COMPUTATIONAL EFFICIENCY;

EID: 77949815740     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FCST.2009.30     Document Type: Conference Paper

References (12)

1. Hadoop. http://hadoop.apache.org/.
2. S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D. U. Hwang. Complex networks: Structure and dynamics. Physics Reports, 424(4-5):175-308, February 2006.
3. C. Bron and J. Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Commun. ACM, 16(9):575-577, September 1973.
4. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. OSDI '04, pages 137-150, 2004.
5. N. Du, B. Wu, L. Xu, B. Wang, and X. Pei. A parallel algorithm for enumerating all maximal cliques in complex network. ICDMW '06: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops, pages 320-324, 2006.
6. R. M. Karp and A. Wigderson. A fast parallel algorithm for the maximal independent set problem. ACM Press, 32(4):762-773, 1985.
7. K. Makino and T. Uno. New algorithms for enumerating all maximal cliques. Algorithm Theory, pages 260-272, 2004.
8. N. Modani and K. Dey. Large maximal cliques enumeration in sparse graphs. CIKM '08: Proceeding of the 17th ACM conference on Information and knowledge management, pages 1377-1378, 2008.
9. G. Palla, I. Derenyi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435(7043):814-818, June 2005.
10. E. Tomita, A. Tanaka, and H. Takahashi. The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Computer Science, 363(1):28-42, 2006.
11. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa. A new algorithm for generating all the maximal independent sets. SIAM J. COMPUT., 6:505-517, 1977.
12. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393(6684):440-442, June 1998.