An improved parameterized algorithm for the independent feedback vertex set problem

In this paper, we develop a new parameterized algorithm for the Independent Feedback Vertex Set problem. Given a graph G=(V,E), the goal of the problem is to determine whether there exists a vertex subset F⊆V such that V−F induces a forest in G and F is an independent set. We show that there exists...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 535; s. 25 - 30
Hlavní autor:	Song, Yinglei
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 22.05.2014
Témata:	Dynamic programming Independent feedback vertex set Parameterized algorithm Independent feedback vertex set Parameterized algorithm Dynamic programming
ISSN:	0304-3975, 1879-2294
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	In this paper, we develop a new parameterized algorithm for the Independent Feedback Vertex Set problem. Given a graph G=(V,E), the goal of the problem is to determine whether there exists a vertex subset F⊆V such that V−F induces a forest in G and F is an independent set. We show that there exists a parameterized algorithm that can determine whether a graph contains an IFVS of size k or not in time O(4kn2). To our best knowledge, this result improves the known upper bound for this problem, which is O(5knO(1)).
ISSN:	0304-3975 1879-2294
DOI:	10.1016/j.tcs.2014.03.031