| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438748 | Theoretical Computer Science | 2006 | 11 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
