Data reduction and exact algorithms for clique cover

Authors:
Jens Gramm;Jiong Guo;Falk Hüffner;Rolf Niedermeier
Affiliations:
Eberhard-Karls-Universität Tübingen, Tübingen, Germany;Friedrich-Schiller-Universität Jena, Jena, Germany;Friedrich-Schiller-Universität Jena, Jena, Germany;Friedrich-Schiller-Universität Jena, Jena, Germany
Venue:
Journal of Experimental Algorithmics (JEA)
Year:
2009

Citing 11
Cited 11

Handling irregular ILP within conventional VLIW schedulers using artificial resource constraints

CASES '00 Proceedings of the 2000 international conference on Compilers, architecture, and synthesis for embedded systems
Enumerating all connected maximal common subgraphs in two graphs

Theoretical Computer Science
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
On the Tree-Degree of Graphs

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Polynomial-time data reduction for dominating set

Journal of the ACM (JACM)
Bipartite structure of all complex networks

Information Processing Letters
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Efficiently covering complex networks with cliques of similar vertices

Theoretical Computer Science - Complex networks
Invitation to data reduction and problem kernelization

ACM SIGACT News
Algorithms for compact letter displays: Comparison and evaluation

Computational Statistics & Data Analysis
Parameterized Complexity

Parameterized Complexity

Invitation to data reduction and problem kernelization

ACM SIGACT News
Parameterized complexity of the clique partition problem

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Iterative Compression for Exactly Solving NP-Hard Minimization Problems

Algorithmics of Large and Complex Networks
Approximation algorithms for intersection graphs

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Assignment-minimum clique coverings

Journal of Experimental Algorithmics (JEA)
Kernelization --- preprocessing with a guarantee

The Multivariate Algorithmic Revolution and Beyond
Clique cover and graph separation: new incompressibility results

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Confluence in data reduction: bridging graph transformation and kernelization

CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy

Theoretical Computer Science
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

To cover the edges of a graph with a minimum number of cliques is an NP-hard problem with many applications. For this problem we develop efficient and effective polynomial-time data reduction rules that, combined with a search tree algorithm, allow for exact problem solutions in competitive time. This is confirmed by experiments with real-world and synthetic data. Moreover, we prove the fixed-parameter tractability of covering edges by cliques.