Splitting (complicated) surfaces is hard

Let M be an orientable combinatorial surface without boundary. A cycle on M is splitting if it has no self-intersections and it partitions M into two components, neither of which is homeomorphic to a disk. In other words, splitting cycles are simple, separating, and non-contractible. We prove that finding the shortest splitting cycle on a combinatorial surface is NP-hard but fixed-parameter tractable with respect to the surface genus. Specifically, we describe an algorithm to compute the shortest splitting cycle in gO(g)n log n time.

[1]  Afra J. Zomorodian,et al.  Topology for Computing (Cambridge Monographs on Applied and Computational Mathematics) , 2005 .

[2]  Takao Nishizeki,et al.  Shortest noncrossing paths in plane graphs , 2005, Algorithmica.

[3]  Anne Verroust-Blondet,et al.  Computing a canonical polygonal schema of an orientable triangulated surface , 2001, SCG '01.

[4]  Sergio Cabello,et al.  Many Distances in Planar Graphs , 2006, SODA '06.

[5]  J. Stillwell.  Classical topology and combinatorial group theory , 1980 .

[6]  Martin Kutz,et al.  Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time , 2005, SCG '06.

[7]  Jeff Erickson,et al.  Greedy optimal homotopy and homology generators , 2005, SODA '05.

[8]  Jeff Erickson,et al.  Tightening non-simple paths and cycles on surfaces , 2006, SODA '06.

[9]  R. Ho.  Algebraic Topology , 2022 .

[10]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

[11]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[12]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[13]  Francis Lazarus,et al.  Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface , 2003, Graph Drawing.

[14]  Peter Eades,et al.  The complexity of computing minimum separating polygons , 1993, Pattern Recognit. Lett..

[15]  Bojan Mohar,et al.  Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs , 2007, Discret. Comput. Geom..

[16]  J. Hass,et al.  Intersections of curves on surfaces , 1985 .

[17]  D. Epstein.  Curves on 2-manifolds and isotopies , 1966 .

[18]  Jeff Erickson,et al.  Tightening non-simple paths and cycles on surfaces , 2006, SODA 2006.

[19]  Samir Khuller,et al.  Geometric knapsack problems , 1991, Algorithmica.

[20]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[21]  Francis Lazarus,et al.  Optimal pants decompositions and shortest homotopic cycles on an orientable surface , 2003, JACM.

[22]  Jayme Luiz Szwarcfiter,et al.  Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..

[23]  Johannes Blömer,et al.  Computing Sums of Radicals in Polynomial Time , 1991, FOCS.

[24]  Bojan Mohar,et al.  Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs , 2005, ESA.

[25]  Francis Lazarus,et al.  Optimal System of Loops on an Orientable Surface , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[26]  Francis Lazarus,et al.  Optimal System of Loops on an Orientable Surface , 2005, Discret. Comput. Geom..

[27]  Jeff Erickson,et al.  Optimally Cutting a Surface into a Disk , 2002, SCG '02.