Deterministic algorithms for the independent feedback vertex set problem

研究成果: Conference contribution

1 被引用数 (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.

本文言語English
ホスト出版物のタイトルCombinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers
編集者Dalibor Froncek, Jan Kratochvíl, Mirka Miller
出版社Springer Verlag
ページ351-363
ページ数13
ISBN(電子版)9783319193144
DOI
出版ステータスPublished - 2015
イベント25th International Workshop on Combinatorial Algorithms, IWOCA 2014 - Duluth, United States
継続期間: 2014 10 152014 10 17

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
8986
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other25th International Workshop on Combinatorial Algorithms, IWOCA 2014
国/地域United States
CityDuluth
Period14/10/1514/10/17

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Deterministic algorithms for the independent feedback vertex set problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル