Computing the Girth of a Planar Graph in O(n logn) Time
type: Item
instance of: scholarly article
title: Computing the Girth of a Planar Graph in O(n logn) Time
zbMATH Open document ID: 1247.05246
DOI: 10.1007/978-3-642-02927-1_63
author: Oren Weimann
author: Raphael Yuster
published in: Automata, Languages and Programming
publication date: 2009-07-14T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5578388
zbMATH Keywords: girth
zbMATH Keywords: shortest cycle
zbMATH Keywords: bounded genus
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-642-02927-1 63
OpenAlex ID: W1695070436
Recommended article: Computing the Girth of a Planar Graph in $O(n \logn)$ Time
Recommended article: Computing the girth of a planar graph in linear time
Recommended article: Q2754199
Recommended article: A faster algorithm for computing the girth of planar and bounded genus graphs
Recommended article: Approximating the Diameter of Planar Graphs in Near Linear Time
Recommended article: Q4859585
Recommended article: Maximizing the size of planar graphs under girth constraints
description: scientific article