期刊
THEORY OF COMPUTING SYSTEMS
卷 65, 期 2, 页码 323-343出版社
SPRINGER
DOI: 10.1007/s00224-020-10005-w
关键词
Graph algorithms; Parameterized complexity
The Cluster Vertex Deletion problem involves finding a set of at most k vertices whose removal results in connected components that are all cliques. We have developed an algorithm for Cluster Vertex Deletion with a running time of O*(1.811(k)).
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)).
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据