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 条
  • [31] On Bounded-Degree Vertex Deletion parameterized by treewidth
    Betzler, Nadja
    Bredereck, Robert
    Niedermeier, Rolf
    Uhlmann, Johannes
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (1-2) : 53 - 60
  • [32] Vertex Deletion Parameterized by Elimination Distance and Even Less
    Jansen, Bart M. P.
    de Kroon, Jari J. H.
    Wlodarczyk, Michal
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 1757 - 1769
  • [33] Parameterized complexity of vertex deletion into perfect graph classes
    Heggernes, Pinar
    Van't Hof, Pim
    Jansen, Bart M. P.
    Kratsch, Stefan
    Villanger, Yngve
    THEORETICAL COMPUTER SCIENCE, 2013, 511 : 172 - 180
  • [34] Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems
    Jacob, Ashwin
    Raman, Venkatesh
    Sahlot, Vibha
    COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 325 - 337
  • [35] Faster parameterized algorithm for BICLUSTER EDITING
    Tsur, Dekel
    INFORMATION PROCESSING LETTERS, 2021, 168
  • [36] A faster parameterized algorithm for temporal matching
    Zschoche, Philipp
    INFORMATION PROCESSING LETTERS, 2022, 174
  • [37] A faster parameterized algorithm for set packing
    Koutis, I
    INFORMATION PROCESSING LETTERS, 2005, 94 (01) : 7 - 9
  • [38] Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
    Wlodarczyk, Michal
    ALGORITHMICA, 2025,
  • [39] Faster algorithms for vertex partitioning problems parameterized by clique-width
    Oum, Sang-il
    Saether, Sigve Hortemo
    Vatshelle, Martin
    THEORETICAL COMPUTER SCIENCE, 2014, 535 : 16 - 24
  • [40] CLUSTER ALGORITHM FOR VERTEX MODELS
    EVERTZ, HG
    LANA, G
    MARCU, M
    PHYSICAL REVIEW LETTERS, 1993, 70 (07) : 875 - 879
12345