A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs
[chapter]

2013
*
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
*

Let G be a graph embedded on a surface of genus g with b boundary cycles. We describe algorithms to compute multiple types of non-trivial cycles in G, using different techniques depending on whether or not G is an undirected graph. If G is undirected, then we give an algorithm to compute a shortest non-separating cycle in G in 2 O(g) n log log n time. Similar algorithms are given to compute a shortest non-contractible or non-null-homologous cycle in 2 O(g+b) n log log n time. Our algorithms for

doi:10.1137/1.9781611973105.26
dblp:conf/soda/Fox13
fatcat:55cdfkgma5gwbijjibeov2kbie