Topologically Trivial Closed Walks in Directed Surface Graphs
- PDF / 2,382,145 Bytes
- 42 Pages / 439.37 x 666.142 pts Page_size
- 48 Downloads / 153 Views
Topologically Trivial Closed Walks in Directed Surface Graphs Jeff Erickson1
· Yipu Wang1
Received: 15 September 2019 / Revised: 9 May 2020 / Accepted: 29 September 2020 / Published online: 30 November 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract Let G be a directed graph with n vertices and m edges, embedded on a surface S, possibly with boundary, with first Betti number β. We consider the complexity of finding closed directed walks in G that are either contractible (trivial in homotopy) or bounding (trivial in integer homology) in S. Specifically, we describe algorithms to determine whether G contains a simple contractible cycle in O(n + m) time, or a contractible closed walk in O(n + m) time, or a bounding closed walk in O(β(n + m)) time. Our algorithms rely on subtle relationships between strong connectivity in G and in the dual graph G*; our contractible-closed-walk algorithm also relies on a seminal topological result of Hass and Scott. We also prove that detecting simple bounding cycles is NP-hard. We also describe three polynomial-time algorithms to compute shortest contractible closed walks, depending on whether the fundamental group of the surface is free, abelian, or hyperbolic. A key step in our algorithm for hyperbolic surfaces is the construction of a context-free grammar with O(g 2 L 2 ) nonterminals that generates all contractible closed walks of length at most L, and only contractible closed walks, in a system of quads of genus g ≥ 2. Finally, we show that computing shortest simple contractible cycles, shortest simple bounding cycles, and shortest bounding closed walks are all NP-hard. Finally, we consider the complexity of detecting negative closed walks with trivial topology, when some edges of the input graph have negative weights. We show that negative bounding walks can be detected in polynomial time, by reduction to maximum flows. We also describe polynomial-time algorithms to find negative contractible walks in graphs on the torus or any surface with boundary; the remaining case of hyperbolic surfaces remains open. The corresponding problems for simple cycles are all NP-hard. Keywords Computational topology · Graph algorithms · Directed graphs · Homotopy · Homology Editor in Charge: Kenneth Clarkson Research on this paper was partially supported by NSF grant CCF-1408763. An extended abstract of this paper was presented at the 33rd International Symposium on Computational Geometry [35]. Extended author information available on the last page of the article
123
1254
Discrete & Computational Geometry (2020) 64:1253–1294 So they did what any savvy business would do. They hired a consultant. They brought in a contractor. I’m sorry, not a contractor—a contractor. A man who made words smaller by combining them or apostrophizing them. — Gary Gulman, Conan, July 13, 2016
1 Introduction A key step in several algorithms for surface graphs is finding a shortest closed walk and/or simple cycle in the input graph with some interesting topological property. There i
Data Loading...
