A fully dynamic approximation scheme for shortest paths in planar graphs (Q1273930)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully dynamic approximation scheme for shortest paths in planar graphs |
scientific article |
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
