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

• Type: Conference
• Year: 2000
• Where: ICALP
• Authors: Hristo Djidjev
• Keywords: ICALP 2000, N-vertex Planar Graph, Planar Graph, Programming Languages, Shortest Cycle