FPT algorithms for generalized feedback vertex set problems

12/15/2019
by   Bin Sheng, et al.
0

An r-pseudoforest is a graph in which each component can be made into a forest by deleting at most r edges, and a d-quasi-forest is a graph in which each component can be made into a forest by deleting at most d vertices. In this paper, we study the parameterized tractability of deleting minimum number of vertices to obtain r-pseudoforest and d-quasi-forest, generalizing the well studied feedback vertex set problem. We first provide improved FPT algorithm and kernelization results for the r-pseudoforest deletion problem and then we show that the d-quasi-forest deletion problem is also FPT.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/26/2020

Improved FPT Algorithms for Deletion to Forest-like Structures

The Feedback Vertex Set problem is undoubtedly one of the most well-stud...
research
11/25/2020

Solving the r-pseudoforest Deletion Problem in Time Independent of r

The feedback vertex set problem is one of the most studied parameterized...
research
12/09/2020

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion

A cactus is a connected graph that does not contain K_4 - e as a minor. ...
research
03/19/2018

Parameterized complexity of fair deletion problems II

Vertex deletion problems are those where given a graph G and a graph pro...
research
03/02/2018

Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set

Feedback Vertex Set is a classic combinatorial optimization problem that...
research
06/09/2022

Kernelization for Feedback Vertex Set via Elimination Distance to a Forest

We study efficient preprocessing for the undirected Feedback Vertex Set ...
research
05/02/2023

Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem

We study Steiner Forest on H-subgraph-free graphs, that is, graphs that ...

Please sign up or login with your details

Forgot password? Click here to reset