Fixed-Parameter Algorithms for Cluster Vertex Deletion

Falk Hüffner,Rolf Niedermeier,Hannes Moser,Christian Komusiewicz

doi:10.1007/978-3-540-78773-0_61

Fixed-Parameter Algorithms for Cluster Vertex Deletion

Falk Hüffner, Rolf Niedermeier + Show 2 more

Open Access

https://doi.org/10.1007/978-3-540-78773-0_61

Copy DOI

Publication Date: Oct 15, 2008

Citations: 57

Affiliation: Friedrich Schiller University Jena

#CLUSTER VERTEX DELETION #Number Of Vertex Deletions + Show 8 more

Abstract
Full-Text PDF
Similar Papers

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.

Full Text