The Complexity of the Graph Embedding Problem
We investigate the computational complexity of determining if a graph G on v vertices embeds in a surface S. Robertson and Seymour have given an O(v 3) decision algorithm for this embedding problem. We show here how the use the yes/no output from their algorithm to construct the embedding, that is, we self-reduce the search algorithm to the decision algorithm. We conclude that for each fixed surface S there exists an O(v 10) algorithm for constructing an embedding or answering that no embedding exists.
Keywordsgenus embedding computational complexity NP-complete
Unable to display preview. Download preview PDF.
- [BFL]D.J. Brown, M.R. Fellows and M.A. Langston, Polynomial-time self-reducibility: theoretical motivations and practical results,Int. J. Computer Mathematics (to appear).Google Scholar
- [BHKY]J. Battle, F. Harary, Y. Kodama and J.W.T. Youngs, Additivity of the genus of a graph, Bull. Amer. Math. Soc. 68, 565–571.Google Scholar
- [FGM]M.L. Furst, L.L. Gross, and L.A. McGeoch, Finding a maximum-genus graph imbedding, preprint (1987).Google Scholar
- [FMR]I.S. Filotti, G.L. Miller and J. Reif, On determining the genus of a graph in O(v O(G)) steps., Proc. 11th Annual ACM Symp. Theory of Computing (1979), 27–37.Google Scholar
- [MP]A. Meyer and M. Paterson, With what frequency are apparently intractable problems difficult, Technical Report, MIT (1979).Google Scholar
- [RS]N. Robertson and P.D. Seymour, Graph minors XIII: The disjoint paths problem,to appear.Google Scholar
- [T1]Carsten Thomassen, The graph genus problem is NP-complete,preprint.Google Scholar
- [T2]Carsten Thomassen, Embeddings of graphs with no short noncontractible cycles,preprint.Google Scholar