Practical approximation schemes for maximum induced-subgraph problems on K3,3-free or K5-free graphs

  • Zhi-Zhong Chen
Session 6: Graph Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1099)


We show that for an integer k ≥ 2 and an n-vertex graph G without a K3,3 (resp., K5) minor, we can compute k induced subgraphs of G with treewidth ≤ 3k−4 (resp., ≤ 6k−7) in O(kn) (resp., O(kn+n2)) time such that each vertex of G appears in exactly k − 1 of these subgraphs. This leads to practical polynomial-time approximation schemes for various maximum induced-subgraph problems on graphs without a K3,3 or K5 minor. The result extends a well-known result of Baker that there are practical polynomial-time approximation schemes for various maximum induced-subgraph problems on planar graphs.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    N. Alon, P. Seymour, and R. Thomas, A separator theorem for graphs without an excluded minor and its applications, STOC'90.Google Scholar
  2. 2.
    T. Asano, An approach to the subgraph homeomorphism problem, TCS 38 (1985).Google Scholar
  3. 3.
    H.L. Bodlaender, Planar graphs with bounded treewidth, Technical Report.Google Scholar
  4. 4.
    H.L. Bodlaender, Dynamic programming algorithms on graphs with bounded treewidth, ICALP'88, LNCS 317.Google Scholar
  5. 5.
    B.S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. ACM 41 (1994).Google Scholar
  6. 6.
    N. Chiba, T. Nishizeki, and N. Saito, An approximation algorithm for the maximum independent set problem on planar graphs, SIAM-JC 11 (1982).Google Scholar
  7. 7.
    D. Eppstein, Subgraph isomorphism in planar graphs and related problems, SODA '95.Google Scholar
  8. 8.
    D.W. Hall, A note on primitive skew curves, Bull. Amer. Math. Soc. 49 (1943).Google Scholar
  9. 9.
    J. E. Hopcroft and R. E. Tarjan, Dividing a graph into triconnected components, SIAM-JC 2 (1973), 135–158.Google Scholar
  10. 10.
    A. Kanevsky and V. Ramachandran, Improved algorithms for graph four-connectivity, FOCS'87.Google Scholar
  11. 11.
    A. Kézdy and P. McGuinness, Sequential and parallel algorithms to find a K 5, minor, SODA'92. Google Scholar
  12. 12.
    R. J. Lipton and R. E. Tarjan, Applications of a planar separator theorem, SIAM-JC 9 (1980), 615–627.Google Scholar
  13. 13.
    N. Robertson and P.D. Seymour, Graph minors V. Excluding a planar graph, J. Combinatorial Theory Ser. B 41 (1986).Google Scholar
  14. 14.
    J.A. Telle and A. Proskurowski, Practical algorithms on partial k-trees with an application to domination-like problems, WADS'93, LNCS 709.Google Scholar
  15. 15.
    M. Yannakakis, Node-and edge-deletion NP-complete problems, STOC'78. Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Zhi-Zhong Chen
    • 1
  1. 1.Dept. of Math. Sci.Tokyo Denki Univ.SaitamaJapan

Personalised recommendations