84
Voted
SIAMCOMP
2010
14 years 7 months ago
2010
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...
84
Voted
SIROCCO
2010
15 years 2 months ago
2010
Abstract. This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for...
95
Voted
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...