Faster parameterized algorithm for r-pseudoforest deletion

Dekel Tsur

doi:10.1016/j.tcs.2024.115034

Faster parameterized algorithm for r-pseudoforest deletion

Dekel Tsur

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

Abstract

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 r edges. In this paper we give an O^⁎((8r+1)^k)-time algorithm for r-PSEUDOFOREST DELETION for every r≥1.

Original language	American English
Article number	115034
Journal	Theoretical Computer Science
Volume	1028
DOIs	https://doi.org/10.1016/j.tcs.2024.115034
State	Published - 28 Feb 2025

Keywords

Branching algorithms
Graph algorithms
Parameterized complexity

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.tcs.2024.115034

Cite this

@article{da33e77aaaa34a418ee0a3face0faec4,

title = "Faster parameterized algorithm for r-pseudoforest deletion",

abstract = "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 r edges. In this paper we give an O⁎((8r+1)k)-time algorithm for r-PSEUDOFOREST DELETION for every r≥1.",

keywords = "Branching algorithms, Graph algorithms, Parameterized complexity",

author = "Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2024 Elsevier B.V.",

year = "2025",

month = feb,

day = "28",

doi = "10.1016/j.tcs.2024.115034",

language = "American English",

volume = "1028",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Faster parameterized algorithm for r-pseudoforest deletion

AU - Tsur, Dekel

PY - 2025/2/28

Y1 - 2025/2/28

N2 - 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 r edges. In this paper we give an O⁎((8r+1)k)-time algorithm for r-PSEUDOFOREST DELETION for every r≥1.

AB - 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 r edges. In this paper we give an O⁎((8r+1)k)-time algorithm for r-PSEUDOFOREST DELETION for every r≥1.

KW - Branching algorithms

KW - Graph algorithms

KW - Parameterized complexity

UR - http://www.scopus.com/inward/record.url?scp=85212035447&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2024.115034

DO - 10.1016/j.tcs.2024.115034

M3 - Article

SN - 0304-3975

VL - 1028

JO - Theoretical Computer Science

JF - Theoretical Computer Science

M1 - 115034

ER -

Faster parameterized algorithm for r-pseudoforest deletion

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this