Skip to main content

Research Repository

Advanced Search

Browse


Construction of near-optimal vertex clique covering for real-world networks (2015)
Journal Article
Chalupa, D. (2015). Construction of near-optimal vertex clique covering for real-world networks. Computing and Informatics, 34(6), 1397-1417

We 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. Searchi... Read More about Construction of near-optimal vertex clique covering for real-world networks.