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 条
  • [21] Faster deterministic parameterized algorithm for k-PATH
    Tsur, Dekel
    THEORETICAL COMPUTER SCIENCE, 2019, 790 : 96 - 104
  • [22] Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments
    Kumar, Mithilesh
    Lokshtanov, Daniel
    33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [23] A Parameterized Algorithm for Bounded-Degree Vertex Deletion
    Xiao, Mingyu
    COMPUTING AND COMBINATORICS, COCOON 2016, 2016, 9797 : 79 - 91
  • [24] A tight approximation algorithm for the cluster vertex deletion problem
    Aprile, Manuel
    Drescher, Matthew
    Fiorini, Samuel
    Huynh, Tony
    MATHEMATICAL PROGRAMMING, 2023, 197 (02) : 1069 - 1091
  • [25] A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem
    Aprile, Manuel
    Drescher, Matthew
    Fiorini, Samuel
    Huynh, Tony
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2021, 2021, 12707 : 340 - 353
  • [26] A tight approximation algorithm for the cluster vertex deletion problem
    Manuel Aprile
    Matthew Drescher
    Samuel Fiorini
    Tony Huynh
    Mathematical Programming, 2023, 197 : 1069 - 1091
  • [27] A faster FPT algorithm for 3-path vertex cover
    Katrenic, Jan
    INFORMATION PROCESSING LETTERS, 2016, 116 (04) : 273 - 278
  • [28] Faster parameterized algorithm for r-pseudoforest deletion
    Tsur, Dekel
    THEORETICAL COMPUTER SCIENCE, 2025, 1028
  • [29] Guided search and a faster deterministic algorithm for 3-SAT
    Scheder, Dominik
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 60 - 71
  • [30] A faster deterministic algorithm for minimum cycle bases in directed graphs
    Hariharan, Ramesh
    Kavitha, Telikepalli
    Mehlhorn, Kurt
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 250 - 261
12345