Sciweavers

Share
ICALP
2000
Springer

Computing the Girth of a Planar Graph

8 years 10 months ago
Computing the Girth of a Planar Graph
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 upon the best previously known algorithms for this problem. Key words. Girth, shortest cycle, planar graph, graphs of bounded genus AMS subject classifications. 05C38, 68R10
Hristo Djidjev
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where ICALP
Authors Hristo Djidjev
Comments (0)
books