Faster deterministic algorithm for Cactus Vertex Deletion

被引：0
|
作者：
Tsur, Dekel [1 ]
机构：
[1] Ben Gurion Univ Negev, Dept Comp Sci, Beer Sheva, Israel
来源：
INFORMATION PROCESSING LETTERS | 2023年 / 179卷
关键词：
Algorithms; Branching algorithms; Graph algorithms; Parameterized complexity;
D O I：
10.1016/j.ipl.2022.106317
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In the CACTUS VERTEX DELETION (resp., EVEN CYCLE TRANSVERSAL) problem, the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k vertices whose removal from G results in a graph in which every edge belongs to at most one cycle (resp., a graph without even cycles). In this paper we give deterministic O *(13.69k)-time algorithms for CACTUS VERTEX DELETION and EVEN CYCLE TRANSVERSAL.(c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数：5
相关论文
共 50 条
  • [41] An algorithm to recognize weak roman domination stable trees under vertex deletion
    Mahavir, B.
    Pushpam, P. Roushini Leely
    Kamalam, M.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020, 12 (04)
  • [42] An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
    Mamadou Moustapha Kanté
    Eun Jung Kim
    O-joung Kwon
    Christophe Paul
    Algorithmica, 2017, 79 : 66 - 95
  • [43] An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
    Kante, Mamadou Moustapha
    Kim, Eun Jung
    Kwon, O-joung
    Paul, Christophe
    ALGORITHMICA, 2017, 79 (01) : 66 - 95
  • [44] On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion
    Betzler, Nadja
    Bodlaender, Hans L.
    Bredereck, Robert
    Niedermeier, Rolf
    Uhlmann, Johannes
    ALGORITHMICA, 2014, 68 (03) : 715 - 738
  • [45] On Making a Distinguished Vertex Minimum Degree by Vertex Deletion
    Betzler, Nadja
    Bredereck, Robert
    Niedermeier, Rolf
    Uhlmann, Johannes
    SOFSEM 2011: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2011, 6543 : 123 - 134
  • [46] On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion
    Nadja Betzler
    Hans L. Bodlaender
    Robert Bredereck
    Rolf Niedermeier
    Johannes Uhlmann
    Algorithmica, 2014, 68 : 715 - 738
  • [47] Faster Dynamic Matchings and Vertex Connectivity
    Sankowski, Piotr
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 118 - 126
  • [48] Proper Interval Vertex Deletion
    Pim van ’t Hof
    Yngve Villanger
    Algorithmica, 2013, 65 : 845 - 867
  • [49] Polygon evolution by vertex deletion
    Latecki, LJ
    Lakämper, R
    SCALE-SPACE THEORIES IN COMPUTER VISION, 1999, 1682 : 398 - 409
  • [50] Proper Interval Vertex Deletion
    van 't Hof, Pim
    Villanger, Yngve
    ALGORITHMICA, 2013, 65 (04) : 845 - 867
12345