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 条
  • [31] Parameterized Orientable Deletion
    Hanaka, Tesshu
    Katsikarelis, Ioannis
    Lampis, Michael
    Otachi, Yota
    Sikora, Florian
    ALGORITHMICA, 2020, 82 (07) : 1909 - 1938
  • [32] 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
  • [33] 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
  • [34] 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
  • [35] Faster Parameterized Algorithms for Minor Containment
    Adler, Isolde
    Dorn, Frederic
    Fomin, Fedor V.
    Sau, Ignasi
    Thilikos, Dimitrios M.
    ALGORITHM THEORY - SWAT 2010, PROCEEDINGS, 2010, 6139 : 322 - +
  • [36] Faster parameterized algorithms for minor containment
    Adler, Isolde
    Dorn, Frederic
    Fomin, Fedor V.
    Sau, Ignasi
    Thilikos, Dimitrios M.
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (50) : 7018 - 7028
  • [37] A LINEAR-TIME ALGORITHM FOR FINDING A MINIMUM SPANNING PSEUDOFOREST
    GABOW, HN
    TARJAN, RE
    INFORMATION PROCESSING LETTERS, 1988, 27 (05) : 259 - 263
  • [38] Faster Parameterized Algorithms for Minimum Fill-in
    Bodlaender, Hans L.
    Heggernes, Pinar
    Villanger, Yngve
    ALGORITHMICA, 2011, 61 (04) : 817 - 838
  • [39] Faster Parameterized Algorithms Using Linear Programming
    Lokshtanov, Daniel
    Narayanaswamy, N. S.
    Raman, Venkatesh
    Ramanujan, M. S.
    Saurabh, Saket
    ACM TRANSACTIONS ON ALGORITHMS, 2014, 11 (02) : 1 - 31
  • [40] Faster Parameterized Algorithms for Minimum Fill-in
    Hans L. Bodlaender
    Pinar Heggernes
    Yngve Villanger
    Algorithmica, 2011, 61 : 817 - 838
12345