Paper Info
Title
Efficiently covering complex networks with cliques of similar vertices
Abstract
We describe a polynomial 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.
Year
DOI
Venue
2006
10.1016/j.tcs.2005.12.005
Theor. Comput. Sci.
Keywords
DocType
Volume
Random graphs,Intersection graphs,Clique cover algorithm
Journal
355
Issue
ISSN
Citations 
1
0304-3975
15
PageRank 
References 
Authors
1.45
8
2
Name
Order
Citations
PageRank
Michael Behrisch1498.77
Anusch Taraz216837.71