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 条
  • [21] FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters
    Majumdar, Diptapriyo
    Raman, Venkatesh
    FRONTIERS IN ALGORITHMICS, FAW 2017, 2017, 10336 : 209 - 220
  • [22] A Faster Parameterized Algorithm for Treedepth
    Reidl, Felix
    Rossmanith, Peter
    Villaamil, Fernando Sanchez
    Sikdar, Somnath
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 931 - 942
  • [23] Streaming deletion problems parameterized by vertex cover
    Oostveen, Jelle J.
    van Leeuwen, Erik Jan
    arXiv, 2021,
  • [24] Parameterized Complexity Dichotomy for (r, a)-Vertex Deletion
    Baste, Julien
    Faria, Luerbio
    Klein, Sulamita
    Sau, Ignasi
    THEORY OF COMPUTING SYSTEMS, 2017, 61 (03) : 777 - 794
  • [25] Streaming deletion problems parameterized by vertex cover
    Oostveen, Jelle J.
    van Leeuwen, Erik Jan
    THEORETICAL COMPUTER SCIENCE, 2023, 979
  • [26] Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion
    Julien Baste
    Luerbio Faria
    Sulamita Klein
    Ignasi Sau
    Theory of Computing Systems, 2017, 61 : 777 - 794
  • [27] Streaming Deletion Problems Parameterized by Vertex Cover
    Oostveen, Jelle J.
    van Leeuwen, Erik Jan
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2021, 2021, 12867 : 413 - 426
  • [28] Faster Parameterized Algorithms for Deletion to Split Graphs
    Ghosh, Esha
    Kolay, Sudeshna
    Kumar, Mrinal
    Misra, Pranabendu
    Panolan, Fahad
    Rai, Ashutosh
    Ramanujan, M. S.
    ALGORITHMICA, 2015, 71 (04) : 989 - 1006
  • [29] Faster Parameterized Algorithms for Deletion to Split Graphs
    Esha Ghosh
    Sudeshna Kolay
    Mrinal Kumar
    Pranabendu Misra
    Fahad Panolan
    Ashutosh Rai
    M. S. Ramanujan
    Algorithmica, 2015, 71 : 989 - 1006
  • [30] Parameterized algorithm for eternal vertex cover
    Fomin, Fedor V.
    Gaspers, Serge
    Golovach, Petr A.
    Kratsch, Dieter
    Saurabh, Saket
    INFORMATION PROCESSING LETTERS, 2010, 110 (16) : 702 - 706
12345