• Mathematics
  • Published 2000

Computing the girth of a planar graph

@inproceedings{Montanari2000ComputingTG,
  title={Computing the girth of a planar graph},
  author={Ugo Montanari and Jdp Rolim and Emo Welzl},
  year={2000}
}
The girth of a graph G has been defined as the length of a shortest cycle of G. We design an O(n(5/4) log n) algorithm for finding the girth of an undirected n-vertex planar graph, giving the first o(n(2)) algorithm for this problem. Our approach combines several techniques such as graph separation, hammock decomposition, covering of a planar graph with graphs of small tree-width, and dynamic shortest path computation. We discuss extensions and generalizations of our result. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 13 CITATIONS

Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths

  • SIAM J. Discrete Math.
  • 2017
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Computing the Girth of a Planar Graph in O(n logn) Time

VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Graph separators: a parameterized view

  • J. Comput. Syst. Sci.
  • 2003
VIEW 16 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Round-trip nearest neighbors on road networks for location based services

  • 2016 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC)
  • 2016
VIEW 1 EXCERPT
CITES METHODS