Efficiently covering complex networks with cliques of similar vertices

Authors:
Michael Behrisch;Anusch Taraz
Affiliations:
Institut für Informatik, Humboldt-Universität zu Berlin, Berlin, Germany;Zentrum Mathematik, Technische Universität München, München, Germany
Venue:
Theoretical Computer Science - Complex networks
Year:
2006

Citing 5
Cited 6

Random intersection graphs when m= w(n): an equivalence theorem relating the evolution of the G(n, m, p) and G(n,P/italic) models

Random Structures & Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On Random Intersection Graphs: The Subgraph Problem

Combinatorics, Probability and Computing
Bipartite structure of all complex networks

Information Processing Letters
The vertex degree distribution of random intersection graphs

Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part I

Data reduction and exact algorithms for clique cover

Journal of Experimental Algorithmics (JEA)
Enumerating Isolated Cliques in Synthetic and Financial Networks

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Isolation concepts for clique enumeration: Comparison and computational experiments

Theoretical Computer Science
Assignment-minimum clique coverings

Journal of Experimental Algorithmics (JEA)
Solving clique covering in very large sparse random graphs by a technique based on k-fixed coloring tabu search

EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
An analytical investigation of block-based mutation operators for order-based stochastic clique covering algorithms

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.01

Visualization

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.