Abstract
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).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chimani, M., Hliněný, P.: A tighter insertion-based approximation of the crossing number. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 122–134. Springer, Heidelberg (2011)
Chuzhoy, J.: An algorithm for the graph crossing number problem. In: STOC, pp. 303–312 (2011)
Chen, J., Kanchi, S.P., Kanevsky, A.: A note on approximating graph genus. Inf. Process. Lett. 61(6), 317–322 (1997)
Chuzhoy, J., Makarychev, Y., Sidiropoulos, A.: On graph crossing number and edge planarization. In: SODA, pp. 1050–1069 (2011)
Chekuri, C., Sidiropoulos, A.: Approximating the genus of a graph. Manuscript
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)
Gross, J.L., Tucker, T.W.: Topological graph theory. Dover Publications (2001)
Hatcher, A.: Algebraic Topology. Cambridge University Press (2002)
Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21(4), 549–568 (1974)
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)
Leighton, F.T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787–832 (1999)
Chimani, M., Hliněný, P., Mutzel, P.: Approximating the crossing number of apex graphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 432–434. Springer, Heidelberg (2009)
Malnic, A., Mohar, B.: Generating locally cyclic triangulations of surfaces. Journal of Combinatorial Theory, Series B 56(2), 147–164 (1992)
Mohar, B.: A linear time algorithm for embedding graphs in an arbitrary surface. SIAM J. Discrete Math. 12(1), 6–26 (1999)
Mohar, B.: Face covers and the genus problem for apex graphs. Journal of Combinatorial Theory, Series B 82(1), 102–117 (2001)
Mohar, B., Thomassen, C.: Graphs on surfaces. Johns Hopkins studies in the mathematical sciences. Johns Hopkins University Press (2001)
Hlinený, P., Chimani, M.: Approximating the crossing number of graphs embeddable in any orientable surface. In: SODA, pp. 918–927 (2010)
Robertson, N., Seymour, P.D.: Graph minors. VIII. A Kuratowski theorem for general surfaces. J. Comb. Theory, Ser. B 48(2), 255–288 (1990)
Thomassen, C.: The graph genus problem is np-complete. J. Algorithms 10(4), 568–576 (1989)
Thomassen, C.: Triangulating a surface with a prescribed graph. J. Comb. Theory, Ser. B 57(2), 196–206 (1993)
White, A.T.: Graphs of groups on surfaces: interactions and models. North-Holland mathematics studies. Elsevier (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Makarychev, Y., Nayyeri, A., Sidiropoulos, A. (2013). A Pseudo-approximation for the Genus of Hamiltonian Graphs. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2013 2013. Lecture Notes in Computer Science, vol 8096. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40328-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-40328-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40327-9
Online ISBN: 978-3-642-40328-6
eBook Packages: Computer ScienceComputer Science (R0)