A fully dynamic approximation scheme for shortest paths in planar graphs (Q1273930)
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: A fully dynamic approximation scheme for shortest paths in planar graphs |
scientific article; zbMATH DE number 1236699
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully dynamic approximation scheme for shortest paths in planar graphs |
scientific article; zbMATH DE number 1236699 |
Statements
A fully dynamic approximation scheme for shortest paths in planar graphs (English)
0 references
6 January 1999
0 references
sparse substitute graph
0 references
