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

DOI10.1007/978-3-642-02927-1_63zbMath1247.05246OpenAlexW1695070436MaRDI QIDQ3638079

Oren Weimann, Raphael Yuster

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_63

zbMATH Keywords

girthshortest cyclebounded genus

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Computing the Girth of a Planar Graph in O(n logn) Time