Faster parameterized algorithm for r-pseudoforest deletion

被引：0
|
作者：
Tsur, Dekel [1 ]
机构：
[1] Ben Gurion Univ Negev, Dept Comp Sci, Beer Sheva, Israel
来源：
THEORETICAL COMPUTER SCIENCE | 2025年 / 1028卷
关键词：
Graph algorithms; Parameterized complexity; Branching algorithms;
D O I：
10.1016/j.tcs.2024.115034
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In the r-PSEUDOFOREST DELETION problem, the input is a graph G and integers k, r, 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 connected component can be made into a tree by deleting at most redges. In this paper we give an O<^> * ((8r + 1) <^> k) time algorithm for r-PSEUDOFOREST DELETION for every r >= 1.
引用
收藏
页数：4
相关论文
共 50 条
  • [1] A faster parameterized algorithm for PSEUDOFOREST DELETION
    Bodlaender, Hans L.
    Ono, Hirotaka
    Otachi, Yota
    DISCRETE APPLIED MATHEMATICS, 2018, 236 : 42 - 56
  • [2] Faster Parameterized Algorithm for Cluster Vertex Deletion
    Tsur, Dekel
    THEORY OF COMPUTING SYSTEMS, 2021, 65 (02) : 323 - 343
  • [3] Faster Parameterized Algorithm for Cluster Vertex Deletion
    Dekel Tsur
    Theory of Computing Systems, 2021, 65 : 323 - 343
  • [4] Faster parameterized algorithm for pumpkin vertex deletion set
    Tsur, Dekel
    INFORMATION PROCESSING LETTERS, 2019, 147 : 74 - 76
  • [5] An approximation algorithm for the l-pseudoforest deletion problem
    Lin, Mugang
    Feng, Qilong
    Fu, Bin
    Wang, Jianxin
    THEORETICAL COMPUTER SCIENCE, 2020, 806 : 446 - 454
  • [6] 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
  • [7] 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
  • [8] 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
  • [9] Faster parameterized algorithm for BICLUSTER EDITING
    Tsur, Dekel
    INFORMATION PROCESSING LETTERS, 2021, 168
  • [10] A faster parameterized algorithm for temporal matching
    Zschoche, Philipp
    INFORMATION PROCESSING LETTERS, 2022, 174
12345