A faster algorithm for computing the girth of planar and bounded genus graphs (Q3188984)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6341861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster algorithm for computing the girth of planar and bounded genus graphs |
scientific article; zbMATH DE number 6341861 |
Statements
A faster algorithm for computing the girth of planar and bounded genus graphs (English)
0 references
9 September 2014
0 references
girth
0 references
cycles
0 references
dynamic algorithms
0 references
graph algorithms
0 references
graph genus
0 references
graph separators
0 references
hammock decomposition
0 references
path and circuit problems
0 references
planar graphs
0 references
shortest paths
0 references
0.9294966459274292
0 references
0.9266344904899596
0 references
