By Topic

A maximum clique algorithm based on MapReduce

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lin Peng ; Coll. of Comput. Sci. & Technol., Zhejiang Univ., Hangzhou, China ; Wang Zebing ; Guo Ming

Maximum clique problem is a classic problem in the domain of Social Network Analysis. It has always been concerned by people, and many algorithms have been proposed. However, most of the algorithms are based on single computer system. As the social network becoming more and more complex, the traditional analysis methods face significant challenges. This paper presents a distributed algorithm based on MapReduce, the algorithm can run parallelly in computer cluster, it is easy to implement, has good convergence rate and scalability. It works by expanding the current maximum clique step by step. Through the using of pruning optimization, we can reduce the solution space, and further improve the efficiency. This paper also gives testing results and shares some experience about dealing with such problems.

Published in:

Advanced Computer Theory and Engineering (ICACTE), 2010 3rd International Conference on  (Volume:6 )

Date of Conference:

20-22 Aug. 2010