In the Cluster Vertex Deletion problem the input is a graph G and an integer k. The goal is to decide whether there is a set of vertices S of size at most k such that the deletion of the vertices of S from G results in a graph in which every connected component is a clique. We give an algorithm for Cluster Vertex Deletion whose running time is O^∗(1.811^k).

中文翻译：

---

簇顶点删除的快速参数化算法

在“簇顶点删除”问题中，输入为图G和整数k。目的是确定是否存在一组大小不超过k的顶点S，以便从G删除S的顶点会生成一个图形，其中每个相连的分量都是一个集团。我们给出了一种聚类顶点删除算法，其运行时间为O ^∗（1.811 ^k）。