• search hit 4 of 28
Back to Result List

Efficiently covering complex networks with cliques of similar vertices

Please always quote using this URN:urn:nbn:de:0296-matheon-1893
  • 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.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Michael Behrisch, Anusch Taraz
URN:urn:nbn:de:0296-matheon-1893
Referee:Hans Jürgen Prömel
Document Type:Preprint, Research Center Matheon
Language:English
Date of first Publication:2005/05/14
Release Date:2004/06/12
Institute:Humboldt-Universität zu Berlin
Preprint Number:248
Verstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.