Efficient approximation schemes for maximization problems on K3, 3-free or K5-free graphs

Journal of Algorithms

Volumn 26, Issue 1, 1998, Pages 166-187

  Chen, Zhi Zhong ^a  

^a TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000896863     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0894     Document Type: Article

References (16)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA., 1974.
2. N. Alon, P. Seymour, and R. Thomas, A separator theorem for graphs with an excluded minor and its applications, in "Proceedings, Twentysecond ACM Symposium on Theory of Computing, 1990," pp. 293-299.
3. T. Asano, An approach to the subgraph homeomorphism problem, Theoret. Comput. Sci. 38 (1985), 249-267.
4. B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. ACM 41 (1994), 153-180.
5. H. L. Bodlaender, "Planar Graphs with Bounded Treewidth," Technical Report RUU-CS-88-14, Department of Computer Science, University of Utrecth, March 1988.
6. H. L. Bodlaender, Dynamic programming algorithms on graphs with bounded treewidth, in "Proceedings, Fifteenth International Colloquium on Automata, Languages, and Programming, July 1988," Lecture Notes in Computer Science, Vol. 317, Springer-Verlag, Berlin/New York, pp. 105-119.
7. N. Chiba, T. Nishizeki, and N. Saito, An approximation algorithm for the maximum independent set problem on planar graphs, SIAM J. Comput. 11 (1982), 663-675.
8. D. W. Hall, A note on primitive skew curves, Bull. Amer. Math. Soc. 49 (1943), 935-936.
9. J. E. Hopcroft and R. E. Tarjan, Dividing a graph into triconnected components, SIAM J. Comput. 2 (1973), 135-158.
10. A. Kanevsky and V. Ramachandran, Improved algorithms for graph four-connectivity, in "Proceedings of the Twentyeighth IEEE Symposium on Foundations of Computer Science, 1987," pp. 252-259.
11. 5 minor, in "Proceedings, Third ACM-SIAM Symposium on Discrete Algorithms, 1992," pp. 345-356.
12. R. J. Lipton and R. E. Tarjan, Applications of a planar separator theorem, SIAM J. Comput. 9 (1980), 615-627.
13. N. Robertson and P. D. Seymour, Graph minors V. Excluding a planar graph, J. Combin. Theory Ser. B 41 (1986), 92-114.
14. J. A. Telle and A. Proskurowski, Practical algorithms on partial k-trees with an application to domination-like problems, in "Proceedings, Third Workshop on Algorithms and Data Structures, August 1993," Lecture Notes in Computer Science, Vol. 709, Springer-Verlag, Berlin/New York, pp. 610-621.
15. W. T. Tutte, "Connectivity in Graphs," University of Toronto Press, Toronto, 1966.
16. M. Yannakakis, Node- and edge-deletion NP-complete problems, in "Proceedings, Tenth ACM Symposium Theory of Computing, 1978," pp. 253-264.