A Fast Branching Algorithm for Cluster Vertex Deletion

Abstract

In the family of clustering problems we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges). The goal is to identify clusters of similar objects by slightly modifying the graph to obtain a cluster graph (disjoint union of cliques). Huffner et al. (Theory Comput. Syst. 47(1), 196---217, 2010) initiated the parameterized study of Cluster Vertex Deletion, where the allowed modification is vertex deletion, and presented an elegant ??min(2kk6logk+n3,2kkmnlogn)$\mathcal {O}\left (\min (2^{k} k^{6} \log k + n^{3}, 2^{k} km\sqrt {n} \log n)\right )$-time fixed-parameter algorithm, parameterized by the solution size. In the last 5 years, this algorithm remained the fastest known algorithm for Cluster Vertex Deletion and, thanks to its simplicity, became one of the textbook examples of an application of the iterative compression principle. In our work we break the 2k-barrier for Cluster Vertex Deletion and present an ??(1.9102k(n+m))$\mathcal {O}(1.9102^{k} (n+m))$-time branching algorithm. We achieve this improvement by a number of structural observations which we incorporate into the algorithm's branching steps.