Fixed-Parameter Algorithms for Cluster Vertex Deletion [chapter]

Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
Lecture Notes in Computer Science  
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
more » ... 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.
doi:10.1007/978-3-540-78773-0_61 dblp:conf/latin/HuffnerKMN08 fatcat:qlylbaxdlrf25fgs4ci72kr7au