Results 1 
2 of
2
Computing the Girth of a Planar Graph in Linear Time
, 2013
"... The girth of a graph is the minimum weight of all simple cycles of the graph. We study the problem of determining the girth of an nnode unweighted undirected planar graph. The first nontrivial algorithm for the problem, given by Djidjev, runs in O(n5/4 logn) time. Chalermsook, Fakcharoenphol, and N ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
The girth of a graph is the minimum weight of all simple cycles of the graph. We study the problem of determining the girth of an nnode unweighted undirected planar graph. The first nontrivial algorithm for the problem, given by Djidjev, runs in O(n5/4 logn) time. Chalermsook, Fakcharoenphol, and Nanongkai reduced the running time to O(n log2 n). Weimann and Yuster further reduced the running time to O(n logn). In this paper, we solve the problem in O(n) time.