Efficiently covering complex networks with cliques of similar vertices

Efficiently covering complex networks with cliques of similar vertices

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science 2006-04, Vol.355 (1), p.37-47
Hauptverfasser: Behrisch, Michael, Taraz, Anusch
Format: Artikel
Sprache:eng
Schlagworte:
Clique cover algorithm
Intersection graphs
Random graphs
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2005.12.005