Deterministic algorithms for the independent feedback vertex set problem

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


A feedback vertex set F of an undirected graph G is a vertex subset of G whose removal results in a forest. Such a set F is said to be independent if F forms an independent set of G. In this paper, we study the problem of finding an independent feedback vertex set of a given graph with the minimum number of vertices, from the viewpoint of graph classes. This problem is NP-hard even for planar bipartite graphs of maximum degree four. However, we show that the problem is solvable in linear time for graphs having tree-like structures, more specifically, for bounded treewidth graphs, chordal graphs and cographs. We then give a fixed-parameter algorithm for planar graphs when parameterized by the solution size. Such a fixed-parameter algorithm is already known for general graphs, but our algorithm is exponentially faster than the known one.

Original languageEnglish
Title of host publicationCombinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers
EditorsDalibor Froncek, Jan Kratochvíl, Mirka Miller
PublisherSpringer Verlag
Number of pages13
ISBN (Electronic)9783319193144
Publication statusPublished - 2015
Event25th International Workshop on Combinatorial Algorithms, IWOCA 2014 - Duluth, United States
Duration: 2014 Oct 152014 Oct 17

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other25th International Workshop on Combinatorial Algorithms, IWOCA 2014
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Deterministic algorithms for the independent feedback vertex set problem'. Together they form a unique fingerprint.

Cite this