Efficiently covering complex networks with cliques of similar vertices
We describe apolynomial time algorithm for covering graphs with cliques, prove its asymptotic optimality in a random intersection graph model and present experimental results on complex real-world networks. (c) 2006 Elsevier B.V. All rights reserved.
intersection graphs random graphs clique cover algorithm