Computing the girth of a planar graph in o(n log n) time

Research output: Contribution to journalArticlepeer-review

Abstract

We give an O(n logn) algorithm for computi ng 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.

Original languageEnglish
Pages (from-to)609-616
Number of pages8
JournalSIAM Journal on Discrete Mathematics
Volume24
Issue number2
DOIs
StatePublished - 2010

Keywords

  • Girth
  • Graphs of bounded genus
  • Planar graph
  • Shortest cycle

ASJC Scopus subject areas

  • Mathematics (all)

Fingerprint

Dive into the research topics of 'Computing the girth of a planar graph in o(n log n) time'. Together they form a unique fingerprint.

Cite this