Abstract
Efficient enumeration of all maximal cliques in a given graph has many applications in the filed of Graph Theory, Social Network Analysis, Bioinformatics and etc. Recent researches indicate that many networks in our world are complex networks involving massive data. Being as the complete sub-graph, a maximal clique can represent a group of friends who all hang around together. It can also be used to find common sub-topologies in a set of protein structures. However, the large scale of real networks and the exponentially increasing computation time of the clique enumeration problem make most of the existing algorithms unsuitable in the real-world scenarios. Therefore, we present a parallel algorithm Peamc (Parallel Enumeration of All Maximal Cliques) which exploits several new and effective techniques to enumerate all maximal cliques in large-scale complex networks. Experimental results on true-life networks with up to 20 million vertices and 50 million edges show that Peamc can find all the maximal cliques with high efficiency and scalability.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47–97 (2002)
Milo, R., Itzkovitz, S.: Network motifs: Simple building blocks of complex networks. Science 298, 824–827 (2002)
Johnson, D.: On generating all maximal independent sets. Information Processing Letter 27(3)
Scott, J.: Social Network Analysis: A Handbook. Sage Publications, London (2002)
Faisal, N., Abu-Khzam.: On the relative efficiency of maximal clique enumeration algorithms, with application to high-throughput computational biology. In: International Conference on Research Trends in Science and Technology, vol. 557
Tomita, E.: The worst-case time complexity for generating all maximal cliques. Theoretical Computer Science 363, 28–42 (2006)
Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph. Communications of the ACM 16, 575–577 (1973)
Tsukiyama, S.: A new algorithm for generating all the maximal independent sets. SIAM Journal on Computing 6, 487–504 (1977)
Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: 9th Scandinavian Workshop on Algorithm Theory, pp. 260–272
Kose, F., Weckwerth, W., Linke, T., Fiehn, O.: Visualizing plant metabolomic correlation networks using clique-metabolite matrices. Bioinformatics 17, 1198–1208 (2001)
Zeng, Z., Wang, J., Karypis, G.: Coherent closed quasi-clique discovery from large dense graph databases. In: The 12th ACM SIGKDD, pp. 797–802 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Du, N., Wu, B., Xu, L., Wang, B., Xin, P. (2009). Parallel Algorithm for Enumerating Maximal Cliques in Complex Network. In: Zighed, D.A., Tsumoto, S., Ras, Z.W., Hacid, H. (eds) Mining Complex Data. Studies in Computational Intelligence, vol 165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88067-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-88067-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88066-0
Online ISBN: 978-3-540-88067-7
eBook Packages: EngineeringEngineering (R0)