We give an O(n logn) 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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Weimann, O., & Yuster, R. (2009). Computing the girth of a planar graph in O(n logn) time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5555 LNCS, pp. 764–773). https://doi.org/10.1007/978-3-642-02927-1_63
Mendeley helps you to discover research relevant for your work.