Advertisement

Feedback Vertex Sets on Tree Convex Bipartite Graphs

  • Chaoyi Wang
  • Tian Liu
  • Wei Jiang
  • Ke Xu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7402)

Abstract

A feedback vertex set in a graph is a subset of vertices, such that the complement of this subset induces a forest. Finding a minimum feedback vertex set (FVS) is \(\cal{NP}\)-complete on bipartite graphs, but tractable on chordal bipartite graphs. A bipartite graph is called tree convex, if a tree is defined on one part of the vertices, such that for every vertex in the other part, the neighborhood of this vertex induces a subtree. First, we show that chordal bipartite graphs form a proper subset of tree convex bipartite graphs. Second, we show that FVS is \(\cal{NP}\)-complete on the tree convex bipartite graphs where the sum of the degrees of vertices whose degree is at least three on the tree is unbounded. Combined with known tractability where this sum is bounded, we show a dichotomy of complexity of FVS on tree convex bipartite graphs.

Keywords

Bipartite Graph Common Element Vertex Cover Fourth Stage Complete Bipartite Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brandstad, A., Le, V.B., Spinrad, J.P.: Graph Classes - A Survey. Society for Industrial and Applied Mathematics, Philadelphia (1999)CrossRefGoogle Scholar
  2. 2.
    Festa, P., Pardalos, P.M., Resende, M.G.C.: Feedback Set Problems. In: Handbook of Combinatorial Optimization (Supplement Volume A), pp. 209–258. Kluwer Academic Publishers (1999)Google Scholar
  3. 3.
    Jiang, W., Liu, T., Ren, T., Xu, K.: Two Hardness Results on Feedback Vertex Sets. In: Atallah, M., Li, X.-Y., Zhu, B. (eds.) FAW-AAIM 2011. LNCS, vol. 6681, pp. 233–243. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  4. 4.
    Jiang, W., Liu, T., Xu, K.: Tractable Feedback Vertex Sets in Restricted Bipartite Graphs. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol. 6831, pp. 424–434. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  5. 5.
    Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)CrossRefGoogle Scholar
  6. 6.
    Kloks, T., Liu, C.H., Poon, S.H.: Feedback Vertex Set on Chordal Bipartite Graphs. arXiv:1104.3915v1 (2011)Google Scholar
  7. 7.
    Liang, Y.D., Chang, M.S.: Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs. Acta Informatica 34, 337–346 (1997)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Song, Y., Liu, T., Xu, K.: Independent Domination on Tree Convex Bipartite Graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM 2012 and FAW 2012. LNCS, vol. 7285, pp. 129–138. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  9. 9.
    Yannakakis, M.: Node-deletion problem on bipartite graphs. SIAM J. Comput. 10, 310–327 (1981)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Chaoyi Wang
    • 1
  • Tian Liu
    • 1
  • Wei Jiang
    • 1
  • Ke Xu
    • 2
  1. 1.Key Laboratory of High Confidence Software Technologies, Ministry of Education, Institute of Software, School of Electronic Engineering and Computer SciencePeking UniversityBeijingChina
  2. 2.National Lab of Software Development EnvironmentBeihang UniversityBeijingChina

Personalised recommendations