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

11/25/2020
by   Bin Sheng, et al.
0

The feedback vertex set problem is one of the most studied parameterized problems. Several generalizations of the problem have been studied where one is to delete vertices to obtain graphs close to acyclic. In this paper, we give an FPT algorithm for the problem of deleting at most k vertices to get an r-pseudoforest. A graph is an r-pseudoforest if we can delete at most r edges from each component to get a forest. Philip et al. introduced this problem and gave an O^*(c_r^k) algorithm for it, where c_r depends on r double exponentially. In comparison, our algorithm runs in time O^*((10k)^k), independent of r.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/15/2019

FPT algorithms for generalized feedback vertex set problems

An r-pseudoforest is a graph in which each component can be made into a ...
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
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
07/08/2021

Feedback Vertex Set on Geometric Intersection Graphs

In this paper, we present an algorithm for computing a feedback vertex s...
research
03/02/2018

An improved FPT algorithm for Independent Feedback Vertex Set

We study the Independent Feedback Vertex Set problem - a variant of the ...
research
10/26/2018

Mining Maximal Induced Bicliques using Odd Cycle Transversals

Many common graph data mining tasks take the form of identifying dense s...
research
10/20/2017

The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph

Let G=(V,A) be a vertex-colored arc-weighted directed acyclic graph (DAG...

Please sign up or login with your details

Forgot password? Click here to reset