Fixed-parameter algorithms for cluster vertex deletion

Authors:
Falk Hüffner;Christian Komusiewicz;Hannes Moser;Rolf Niedermeier
Affiliations:
Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany
Venue:
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Year:
2008

Citing 14
Cited 6

On efficient fixed-parameter algorithms for weighted vertex cover

Journal of Algorithms
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

Algorithmica
Cluster graph modification problems

Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation

Theory of Computing Systems
Deterministic algorithms for rank aggregation and other ranking and clustering problems

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Parameterized algorithms for HITTING SET: the weighted case

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Improved parameterized upper bounds for vertex cover

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Applying modular decomposition to parameterized bicluster editing

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
The cluster editing problem: implementations and experiments

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Kernels: annotated, proper and induced

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Finding odd cycle transversals

Operations Research Letters
Efficient parameterized preprocessing for cluster editing

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Kernelization algorithms for d-hitting set problems

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A more effective linear kernelization for Cluster Editing

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Iterative Compression and Exact Algorithms

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Iterative Compression for Exactly Solving NP-Hard Minimization Problems

Algorithmics of Large and Complex Networks
Fixed-parameter tractability results for feedback set problems in tournaments

Journal of Discrete Algorithms
Iterative compression and exact algorithms

Theoretical Computer Science
Separator-based data reduction for signed graph balancing

Journal of Combinatorial Optimization
A 2k Kernel for the cluster editing problem

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We initiate the first systematic study of the NP-hard CLUSTER VERTEX DELETION (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted case, one searches for a minimum number of vertex deletions to transform a graph into a collection of disjoint cliques. The parameter is the number of vertex deletions. We present efficient fixed-parameter algorithms for CVD. Our iterative compression algorithm for CVD seems to be the first nontrivial application of this fairly new technique to a problem that is not a feedback set problem. Moreover, we study the variant of CVD where the number of cliques to be generated is specified. Here, we detect connections to fixed-parameter algorithms for (weighted) VERTEX COVER.