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 条
  • [41] Faster algorithms and a smaller kernel for CLIQUES OR TREES VERTEX DELETION
    Tsur, Dekel
    INFORMATION PROCESSING LETTERS, 2025, 190
  • [42] Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property
    Bonnet, Edouard
    Brettell, Nick
    Kwon, O-joung
    Marx, Daniel
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2016, 2016, 9941 : 233 - 244
  • [43] A parameterized algorithm for subset feedback vertex set in tournaments
    Bai, Tian
    Xiao, Mingyu
    THEORETICAL COMPUTER SCIENCE, 2023, 975
  • [44] Parameterized algorithm for 3-path vertex cover
    Tsur, Dekel
    THEORETICAL COMPUTER SCIENCE, 2019, 783 : 1 - 8
  • [45] Faster deterministic parameterized algorithm for k-PATH
    Tsur, Dekel
    THEORETICAL COMPUTER SCIENCE, 2019, 790 : 96 - 104
  • [46] A Faster Parameterized Algorithm for Group Feedback Edge Set
    Ramanujan, M. S.
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2016, 2016, 9941 : 269 - 281
  • [47] Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
    Doucha, Martin
    Kratochvil, Jan
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 348 - 359
  • [48] Fixed-Parameter Algorithms for Cluster Vertex Deletion
    Falk Hüffner
    Christian Komusiewicz
    Hannes Moser
    Rolf Niedermeier
    Theory of Computing Systems, 2010, 47 : 196 - 217
  • [49] Fixed-parameter algorithms for cluster vertex deletion
    Hueffner, Falk
    Komusiewicz, Christian
    Moser, Hannes
    Niedermeier, Rolf
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 711 - 722
  • [50] Fixed-Parameter Algorithms for Cluster Vertex Deletion
    Hueffner, Falk
    Komusiewicz, Christian
    Moser, Hannes
    Niedermeier, Rolf
    THEORY OF COMPUTING SYSTEMS, 2010, 47 (01) : 196 - 217
12345