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

SUMMARY 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 2 log 6 n) time for n-vertex graphs with maximum degree at

[1]  Sue Whitesides,et al.  Grid intersection graphs and boxicity , 1993, Discret. Math..

[2]  Panos M. Pardalos,et al.  Feedback Set Problems , 1999, Handbook of Combinatorial Optimization.

[3]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[4]  Jeremy P. Spinrad,et al.  Efficient graph representations , 2003, Fields Institute monographs.

[5]  Harold N. Gabow,et al.  An augmenting path algorithm for linear matroid parity , 1986, Comb..

[6]  Yoji Kajitani,et al.  On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three , 1988, Discret. Math..

[7]  Jonathan L. Gross,et al.  Finding a maximum-genus graph imbedding , 1988, JACM.

[8]  Ewald Speckenmeyer,et al.  Untersuchungen zum Feedback-vertex-set-Problem in ungerichteten Graphen , 1983 .

[9]  Maw-Shang Chang,et al.  Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs , 1997, Acta Informatica.

[10]  Y. Daniel Liang.  On the Feedback Vertex Set Problem in Permutation Graphs , 1994, Inf. Process. Lett..

[11]  T. Kloks,et al.  Feedback vertex set on chordal bipartite graphs , 2011, 1104.3915.

[12]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[13]  K. Onaga,et al.  Vertex covers and connected vertex covers in 3-connected graphs , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[14]  Ilan Newman,et al.  On grid intersection graphs , 1991, Discret. Math..

[15]  Jeremy P. Spinrad,et al.  Bipartite permutation graphs , 1987, Discret. Appl. Math..

[16]  Asahi Takaoka,et al.  On Minimum Feedback Vertex Sets in Graphs , 2012, 2012 Third International Conference on Networking and Computing.

[17]  Toshinori Yamada,et al.  The undirected feedback vertex set problem with application to wavelength converter placement on WDM networks , 2010, 2010 XIth International Workshop on Symbolic and Numerical Methods, Modeling and Applications to Circuit Design (SM2ACD).

[18]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[19]  Satoshi Tayu,et al.  On orthogonal ray graphs , 2010, Discret. Appl. Math..

[20]  Matthias F. Stallmann,et al.  Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract) , 1985, ICALP.

[21]  Mihalis Yannakakis,et al.  Node-Deletion Problems on Bipartite Graphs , 1981, SIAM J. Comput..

[22]  Yanpei Liu,et al.  Maximum genus and maximum nonseparating independent set of a 3-regular graph , 1997, Discret. Math..

[23]  Harold N. Gabow,et al.  Efficient Algorithms for Graphic Intersection and Parity (Extended Abstract) , 1985 .

[24]  David S. Johnson,et al.  Stockmeyer: some simplified np-complete graph problems , 1976 .