Shortest path computations in source-deplanarized graphs (Q685480)
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 417394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest path computations in source-deplanarized graphs |
scientific article; zbMATH DE number 417394 |
Statements
Shortest path computations in source-deplanarized graphs (English)
0 references
17 October 1993
0 references
shortest path
0 references
planar graph
0 references
0.7883375883102417
0 references
0.7855892181396484
0 references
0.7831763625144958
0 references
0.7804961204528809
0 references
0.7691035270690918
0 references
