Computing the Girth of a Planar Graph in $O(n \logn)$ Time (Q5392914): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 21:07, 5 March 2024
scientific article; zbMATH DE number 5878402
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the Girth of a Planar Graph in $O(n \logn)$ Time |
scientific article; zbMATH DE number 5878402 |
Statements
Computing the Girth of a Planar Graph in $O(n \logn)$ Time (English)
0 references
15 April 2011
0 references
girth
0 references
shortest cycle
0 references
planar graph
0 references
graphs of bounded genus
0 references
