Skip to main content
Article thumbnail
Location of Repository


By Hristo N. (-lanl-if


A faster algorithm for computing the girth of planar and bounded genus graphs. (English summary) ACM Trans. Algorithms 7 (2010), no. 1, Art. 3, 16 pp. Summary: “The girth of a graph G is the length of a shortest cycle of G. In this article we design an O(n 5/4 log n) algorithm for finding the girth of an undirected n-vertex planar graph, the first o(n 2) algorithm for this problem. We also extend our results for the class of graphs embedded into an orientable surface of small genus. Our approach uses several techniques such as graph partitioning, hammock decomposition, graph covering, and dynamic shortest-path computation. We discuss extensions and generalizations of our result.

Topics: MR0523321 (80e, 05058
Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.