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 条
  • [21] Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
    Philips, Geevarghese
    Rai, Ashutosh
    Saurabh, Saket
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT II, 2015, 9235 : 517 - 528
  • [22] Faster deterministic algorithm for Cactus Vertex Deletion
    Tsur, Dekel
    INFORMATION PROCESSING LETTERS, 2023, 179
  • [23] Faster algorithm for pathwidth one vertex deletion
    Tsur, Dekel
    THEORETICAL COMPUTER SCIENCE, 2022, 921 : 63 - 74
  • [24] A Parameterized Algorithm for Bounded-Degree Vertex Deletion
    Xiao, Mingyu
    COMPUTING AND COMBINATORICS, COCOON 2016, 2016, 9797 : 79 - 91
  • [25] An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion
    Yuuki Aoike
    Tatsuya Gima
    Tesshu Hanaka
    Masashi Kiyomi
    Yasuaki Kobayashi
    Yusuke Kobayashi
    Kazuhiro Kurita
    Yota Otachi
    Theory of Computing Systems, 2022, 66 : 502 - 515
  • [26] An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion
    Aoike, Yuuki
    Gima, Tatsuya
    Hanaka, Tesshu
    Kiyomi, Masashi
    Kobayashi, Yasuaki
    Kobayashi, Yusuke
    Kurita, Kazuhiro
    Otachi, Yota
    THEORY OF COMPUTING SYSTEMS, 2022, 66 (02) : 502 - 515
  • [27] A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
    Slivovsky, Friedrich
    Szeider, Stefan
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, SAT 2020, 2020, 12178 : 267 - 276
  • [28] 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
  • [29] Polyhedral aspects of feedback vertex set and pseudoforest deletion set
    Chandrasekaran, Karthekeyan
    Chekuri, Chandra
    Fiorini, Samuel
    Kulkarni, Shubhang
    Weltge, Stefan
    MATHEMATICAL PROGRAMMING, 2025,
  • [30] Parameterized Orientable Deletion
    Tesshu Hanaka
    Ioannis Katsikarelis
    Michael Lampis
    Yota Otachi
    Florian Sikora
    Algorithmica, 2020, 82 : 1909 - 1938
12345