Construction of Near-Optimal Vertex Clique Covering for Real-World Networks
Keywords:Clique covering, independent set, community detection, stochastic algorithms, heuristics
AbstractWe propose a method based on combining a constructive and a bounding heuristic to solve the vertex clique covering problem (CCP), where the aim is to partition the vertices of a graph into the smallest number of classes, which induce cliques. Searching for the solution to CCP is highly motivated by analysis of social and other real-world networks, applications in graph mining, as well as by the fact that CCP is one of the classical NP-hard problems. Combining the construction and the bounding heuristic helped us not only to find high-quality clique coverings but also to determine that in the domain of real-world networks, many of the obtained solutions are optimal, while the rest of them are near-optimal. In addition, the method has a polynomial time complexity and shows much promise for its practical use. Experimental results are presented for a fairly representative benchmark of real-world data. Our test graphs include extracts of web-based social networks, including some very large ones, several well-known graphs from network science, as well as coappearance networks of literary works' characters from the DIMACS graph coloring benchmark. We also present results for synthetic pseudorandom graphs structured according to the Erdös-Renyi model and Leighton's model.
Download data is not yet available.
How to Cite
Chalupa, D. (2016). Construction of Near-Optimal Vertex Clique Covering for Real-World Networks. COMPUTING AND INFORMATICS, 34(6), 1397–1417. Retrieved from https://www.cai.sk/ojs/index.php/cai/article/view/1276