TY - GEN A1 - Behrisch, Michael A1 - Taraz, Anusch T1 - Efficiently covering complex networks with cliques of similar vertices N2 - 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. Y1 - 2005 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/189 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-1893 ER -