Computing the Girth of a Planar Graph in O(n logn) Time (Q3638079)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the Girth of a Planar Graph in O(n logn) Time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the Girth of a Planar Graph in O(n logn) Time |
scientific article |
Statements
Computing the Girth of a Planar Graph in O(n logn) Time (English)
0 references
14 July 2009
0 references
girth
0 references
shortest cycle
0 references
bounded genus
0 references
0 references
0.96488863
0 references
0.96488863
0 references
0.89939183
0 references
0.8973982
0 references
0.8973982
0 references
