Scalable maximum clique computation using MapReduce

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2013, Pages 74-85

  Xiang, Jingen ^a   Guo, Cong ^a   Aboulnaga, Ashraf ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENT SIZES; FAULT-TOLERANT; LOAD IMBALANCE; MAPREDUCE FRAMEWORKS; MAXIMUM CLIQUE; MAXIMUM CLIQUE PROBLEMS; PARTITIONING METHODS; RECURSIVE PARTITIONING;

ENGINEERING; INDUSTRIAL ENGINEERING;

REGRESSION ANALYSIS;

EID: 84881364571     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2013.6544815     Document Type: Conference Paper

References (35)

1. L. Akoglu, H. Tong, B. Meeder, and C. Faloutsos. PICS: Parameter-free identification of cohesive subgroups in large attributed graphs. In Proc. SIAM Data Mining Conf. (SDM), 2012.
2. N. Alon, M. Krivelevich, and B. Sudakov. Finding a large hidden clique in a random graph. In Symp. on Discrete Algorithms (SODA), 1998.
3. R. Carraghan and P. M. Pardalos. An exact algorithm for the maximum clique problem. Operations Research Letters, 9(6), 1990.
4. I. Chuang, A. Cross, G. Smith, J. Smolin, and B. Zeng. Codeword stabilized quantum codes: Algorithm and structure. J. Mathematical Physics, 50(4), 2009.
5. A. Cross, G. Smith, J. Smolin, and B. Zeng. Codeword stabilized quantum codes. IEEE Trans. on Information Theory, 55(1), 2009.
6. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. Comm. ACM, 51(1), 2008.
7. DIMACS Benchmark Set. http://iridia.ulb.ac.be/∼fmascia/maximum- clique/.
8. DIMACS Implementation Challenges. http://dimacs.rutgers.edu/Challenges/.
9. X. Dimitropoulos, D. Krioukov, M. Fomenkov, B. Huffaker, Y. Hyun, kc Claffy, and G. Riley. AS relationships: inference and validation. SIGCOMM Comp. Comm. Rev., 37(1), 2007.
10. Amazon Elastic Compute Cloud (Amazon EC2). http://aws.amazon.com/ec2/.
11. L. Gao. On inferring autonomous system relationships in the internet. IEEE/ACM Trans. Netw., 9(6), 2001.
12. E. Gardiner, P. Artymiuk, and P. Willett. Clique-detection algorithms for matching three-dimensional molecular structures. J. Molecular Graphics and Modelling, 15(4), 1997.
13. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., 1979.
14. Giraph project. http://giraph.apache.org/.
15. W. Gropp, E. Lusk, N. Doss, and A. Skjellum. A high-performance, portable implementation of the MPI message passing interface standard. Parallel Comp., 22(6), 1996.
16. L. W. Hagen and A. B. Kahng. New spectral methods for ratio cut partitioning and clustering. IEEE Trans. on CAD of Integrated Circuits and Systems, 11(9), 1992.
17. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. In Proc. Conf. on Supercomputing (SC), 1995.
18. C. W. Huffman and V. Pless. Fundamentals of Error-Correcting Codes. Cambridge University Press, 2003.
19. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49, 1970.
20. P. Lin, Z. Wang, and M. Guo. A maximum clique algorithm based on MapReduce. Proc. Int. Conf. on Advanced Computer Theory and Engineering, 2010.
21. R. D. Luce and A. Perry. A method of matrix analysis of group structure. Psychometrika, 14, 1949.
22. F. MacWilliams and N. Sloane. The Theory of Error-Correcting Codes. North-Holland, second edition, 1978.
23. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2010.
24. P. R. Östergård. A fast algorithm for the maximum clique problem. Discrete Applied Mathematics, 120(1-3), 2002.
25. P. M. Pardalos, J. Rappe, and M. G. Resende. An exact parallel algorithm for the maximum clique problem. High Performance Algorithms and Software in Nonlinear Optimization, 38, 1998.
26. P. M. Pardalos and J. Xue. The maximum clique problem. J. Global Optimization, 4(3), 1994.
27. M. Sellmann, N. Sensen, and L. Timajev. Multicommodity flow approximation used for exact graph partitioning. In Proc. Annual European Symp. on Algorithms (ESA), 2003.
28. N. Sensen. Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows. In Proc. Annual European Symp. on Algorithms (ESA), 2001.
29. M. Sipser. Introduction to the Theory of Computation. Course Technology, third edition, 2012.
30. E. Tomita and T. Kameda. An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Global Optimization, 37(1), 2007.
31. E. Tomita, Y. Sutani, T. Higashi, S. Takahashi, and M. Wakatsuki. A simple and faster branch-and-bound algorithm for finding a maximum clique. In WALCOM: Algorithms and Computation. Springer, 2010.
32. L. G. Valiant. A bridging model for parallel computation. Comm. ACM, 33(8), 1990.
33. J. Wang and J. Cheng. Truss decomposition in massive networks. Proc. VLDB Endowment (PVLDB), 5(9), 2012.
34. B. Wu, S. Yang, H. Zhao, and B. Wang. A distributed algorithm to enumerate all maximal cliques in MapReduce. In Proc. Int. Conf. on Frontiers of Computer Science and Technology, 2009.
35. S. Yang, X. Yan, B. Zong, and A. Khan. Towards effective partition management for large graphs. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2012.