A note on approximating graph genus

Information Processing Letters

Volumn 61, Issue 6, 1997, Pages 317-322

  Chen, Jianer ^a   Kanchi, Saroja P ^b   Kanevsky, Arkady ^c  

^a TEXAS A AND M UNIVERSITY   (United States)

^b KETTERING UNIVERSITY   (United States)

^c MITRE CORPORATION   (United States)

Author keywords

Algorithms; Approximation algorithm; Combinatorial analysis; Combinatorial problems; Graph embedding; Theory of computation

Indexed keywords

EID: 0042134393     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00203-2     Document Type: Review

References (13)

1. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and intractability of approximation problems, in: Proc. 33rd IEEE Symp. on Foundation of Computer Science (1992) 14-23.
2. J. Chen, Algorithmic graph embeddings, Theoret. Comput. Sci. (1997), to appear.
3. J. Chen, S.P. Kanchi and A. Kanevsky, On the complexity of graph embeddings, in: WADS'93, Lecture Notes in Computer Science, Vol. 709 (Springer, Berlin, 1993) 234-245.
4. H.N. Djidjev, A separator theorem for graphs of fixed genus, Serdica Bulgar. Math. Publ. 11 (1985) 319-329.
5. H.N. Djidjev and S.M. Venkatesan, Planarization of graphs embedded on surfaces, Lecture Notes in Computer Science, Vol. 1017 (Springer, Berlin, 1995) 62-72.
6. I.S. Filotti and J.N. Mayer, A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus, in: Proc. 12th Ann. ACM Symp. on Theory of Computing (1980) 236-243.
7. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
8. J.L. Gross and M.L. Furst. Hierarchy of imbedding-distribution invariants of a graph, J. Graph Theory 11 (1987) 205-220.
9. J.L. Gross and T.W. Tucker, Topological Graph Theory (Wiley/Interscience, New York, 1987).
10. J.E. Hopcroft and R.E. Tarjan, Efficient planarity testing, J. ACM 21 (1974) pp. 549-568.
11. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems. J. ACM 41 (1994) 960-981.
12. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction (Springer, Berlin, 1985).
13. C. Thomassen, The graph genus problem is NP-complete, J. Algorithms 10 (1989) 568-576.