A Pseudo-approximation for the Genus of Hamiltonian Graphs
The genus of a graph is a very basic parameter in topological graph theory, that has been the subject of extensive study. Perhaps surprisingly, despite its importance, the problem of approximating the genus of a graph is very poorly understood. It has been shown to be NPcomplete by Thomassen [Tho89], and the best known upper bound for general graphs is an O(n)-approximation that follows by Euler’s characteristic.
We give a polynomial-time pseudo-approximation algorithm for the orientable genus of Hamiltonian graphs. More specifically, on input a graph G of orientable genus g, and a Hamiltonian path in G, our algorithm computes a drawing into a surface of either orientable, or nonorientable genus g O(1).
KeywordsHamiltonian Path Local Edge Hamiltonian Graph Elementary Band Primary Segment
Unable to display preview. Download preview PDF.
- [Chu11]Chuzhoy, J.: An algorithm for the graph crossing number problem. In: STOC, pp. 303–312 (2011)Google Scholar
- [CMS11]Chuzhoy, J., Makarychev, Y., Sidiropoulos, A.: On graph crossing number and edge planarization. In: SODA, pp. 1050–1069 (2011)Google Scholar
- [CS]Chekuri, C., Sidiropoulos, A.: Approximating the genus of a graph. ManuscriptGoogle Scholar
- [FMR79]Filotti, I.S., Miller, G.L., Reif, J.H.: On determining the genus of a graph in O(v O(g)) steps. In: STOC, pp. 27–37 (1979)Google Scholar
- [GT01]Gross, J.L., Tucker, T.W.: Topological graph theory. Dover Publications (2001)Google Scholar
- [Hat02]Hatcher, A.: Algebraic Topology. Cambridge University Press (2002)Google Scholar
- [KiMR08]Ken-ichi, Mohar, B., Reed, B.A.: A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width. In: FOCS, pp. 771–780 (2008)Google Scholar
- [MT01]Mohar, B., Thomassen, C.: Graphs on surfaces. Johns Hopkins studies in the mathematical sciences. Johns Hopkins University Press (2001)Google Scholar
- [PH10]Hlinený, P., Chimani, M.: Approximating the crossing number of graphs embeddable in any orientable surface. In: SODA, pp. 918–927 (2010)Google Scholar
- [Whi01]White, A.T.: Graphs of groups on surfaces: interactions and models. North-Holland mathematics studies. Elsevier (2001)Google Scholar