A fully dynamic approximation scheme for shortest paths in planar graphs (Q1273930): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/pl00009223 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028558845 / rank | |||
Normal rank | |||
Latest revision as of 10:55, 30 July 2024
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
