Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs

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.

[1]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[2]  Andre E. Kezdy,et al.  Sequential and parallel algorithms to find a K 5 minor , 1992, SODA 1992.

[3]  Takao Asano,et al.  An Approach to the Subgraph Homeomorphism Problem , 1985, Theor. Comput. Sci..

[4]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[5]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[6]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[7]  Jan Arne Telle,et al.  Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems , 1993, WADS.

[8]  Robin Thomas,et al.  A separator theorem for graphs with an excluded minor and its applications , 1990, STOC '90.

[9]  David Eppstein,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.

[10]  H. Bodlaender.  Planar graphs with bounded treewidth , 1988 .

[11]  D. W. Hall.  A note on primitive skew curves , 1943 .

[12]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[13]  Norishige Chiba,et al.  An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs , 1982, SIAM J. Comput..

[14]  Arkady Kanevsky,et al.  Improved algorithms for graph four-connectivity , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[15]  Hans L. Bodlaender,et al.  Dynamic Programming on Graphs with Bounded Treewidth , 1988, ICALP.