On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs

Asahi TAKAOKA; Satoshi TAYU; Shuichi UENO

doi:10.1587/transinf.E96.D.2327

IEICE Transactions on Information and Systems

Online ISSN : 1745-1361
Print ISSN : 0916-8532

Regular Section

On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs

Asahi TAKAOKA, Satoshi TAYU, Shuichi UENO

Author information

Keywords: 3-regular graph, bipartite permutation graph, feedback vertex set, grid intersection graph, nonseparating independent set

JOURNAL FREE ACCESS

2013 Volume E96.D Issue 11 Pages 2327-2332

DOI https://doi.org/10.1587/transinf.E96.D.2327

Details

Abstract

We consider the minimum feedback vertex set problem for some bipartite graphs and degree-constrained graphs. We show that the problem is linear time solvable for bipartite permutation graphs and NP-hard for grid intersection graphs. We also show that the problem is solvable in O(n²log ⁶n) time for n-vertex graphs with maximum degree at most three.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!