Dynamic algorithms for shortest paths in planar graphs (Q685367)
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: Dynamic algorithms for shortest paths in planar graphs |
scientific article; zbMATH DE number 417324
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic algorithms for shortest paths in planar graphs |
scientific article; zbMATH DE number 417324 |
Statements
Dynamic algorithms for shortest paths in planar graphs (English)
0 references
17 October 1993
0 references
maintaining shortest paths
0 references
maintaining the maximum flow
0 references
planar network
0 references
0.9935023188591005
0 references
0.9071130752563475
0 references
0.9031331539154052
0 references
0.8968966007232666
0 references
