Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
Dynamic generators of topologically embedded graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Tightening non-simple paths and cycles on surfaces
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Splitting (complicated) surfaces is hard
Proceedings of the twenty-second annual symposium on Computational geometry
Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time
Proceedings of the twenty-second annual symposium on Computational geometry
Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs
Discrete & Computational Geometry
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Multiple source shortest paths in a genus g graph
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Output-sensitive algorithm for the edge-width of an embedded graph
Proceedings of the twenty-sixth annual symposium on Computational geometry
Shortest non-trivial cycles in directed surface graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
Tightening Nonsimple Paths and Cycles on Surfaces
SIAM Journal on Computing
Global minimum cuts in surface embedded graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Minimum cuts and shortest non-separating cycles via homology covers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Algorithms for the edge-width of an embedded graph
Computational Geometry: Theory and Applications
Finding Cycles with Topological Properties in Embedded Graphs
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
A cycle on a combinatorial surface is tight if it as short as possible in its (free) homotopy class. We describe an algorithm to compute a single tight, noncontractible, essentially simple cycle on a given orientable combinatorial surface in O(n log n) time. The only method previously known for this problem was to compute the globally shortest noncontractible or nonseparating cycle in O(min{g3,n}, n log n) time, where g is the genus of the surface. As a consequence, we can compute the shortest cycle freely homotopic to a chosen boundary cycle in O(n log n) time, a tight octagonal decomposition in O(gnlog n) time, and a shortest contractible cycle enclosing a nonempty set of faces in O(nlog2 n) time.