SIAMCOMP
2010
13 years 6 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...
SIROCCO
2010
14 years 28 days 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...
ICALP
2000
Springer
14 years 3 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...