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 条
  • [31] A simple (2+∈)-approximation algorithm for Split Vertex Deletion
    Drescher, Matthew
    Fiorini, Samuel
    Huynh, Tony
    EUROPEAN JOURNAL OF COMBINATORICS, 2024, 121
  • [32] A faster algorithm for sorting genomes by reciprocal translocation, insertion and deletion
    Hao, Fanchang
    Luan, Junfeng
    Zhu, Daming
    Zhang, Peng
    Li, Ming
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2010, 47 (11): : 2011 - 2023
  • [33] Faster deterministic dictionaries
    Pagh, R
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 487 - 493
  • [34] An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion
    Marek Cygan
    Marcin Pilipczuk
    Michał Pilipczuk
    Jakub Onufry Wojtaszczyk
    Algorithmica, 2012, 64 : 170 - 188
  • [35] An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion
    Cygan, Marek
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Wojtaszczyk, Jakub Onufry
    ALGORITHMICA, 2012, 64 (01) : 170 - 188
  • [36] An improved parameterized algorithm for the p-cluster vertex deletion problem
    Bang Ye Wu
    Li-Hsuan Chen
    Journal of Combinatorial Optimization, 2017, 33 : 373 - 388
  • [37] An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion
    Cygan, Marek
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Wojtaszczyk, Jakub Onufry
    PARAMETERIZED AND EXACT COMPUTATION, 2010, 6478 : 95 - 106
  • [38] An improved parameterized algorithm for the p-cluster vertex deletion problem
    Wu, Bang Ye
    Chen, Li-Hsuan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (02) : 373 - 388
  • [39] Quadratic vertex kernel for split vertex deletion
    Agrawal, Akanksha
    Gupta, Sushmita
    Jain, Pallavi
    Krithika, R.
    THEORETICAL COMPUTER SCIENCE, 2020, 833 : 164 - 172
  • [40] FASTER DETERMINISTIC INTEGER FACTORIZATION
    Costa, Edgar
    Harvey, David
    MATHEMATICS OF COMPUTATION, 2014, 83 (285) : 339 - 345
12345