Practical approximation schemes for maximum induced-subgraph problems on k3,3-free or k5-free graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1099, Issue , 1996, Pages 268-279

  Chen, Zhi Zhong ^a  

^a TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; POLYNOMIAL APPROXIMATION; ROBOTS;

APPROXIMATION SCHEME; FREE GRAPHS; INDUCED SUBGRAPHS; N-VERTEX GRAPH; PLANAR GRAPH; POLYNOMIAL TIME APPROXIMATION SCHEMES; SUBGRAPHS; TREE-WIDTH;

GRAPH THEORY;

EID: 84947772210     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_134     Document Type: Conference Paper

References (15)

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