Faster Parameterized Algorithm for Cluster Vertex Deletion

被引：12
|
作者：
Tsur, Dekel [1 ]
机构：
[1] Ben Gurion Univ Negev, Beer Sheva, Israel
来源：
THEORY OF COMPUTING SYSTEMS | 2021年 / 65卷 / 02期
关键词：
Graph algorithms; Parameterized complexity;
D O I：
10.1007/s00224-020-10005-w
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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)).
引用
收藏
页码：323 / 343
页数：21
相关论文
共 50 条
12345