A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs (Q5060135): 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/3-540-57155-8_269 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1485876617 / rank | |||
Normal rank | |||
Revision as of 18:19, 19 March 2024
scientific article; zbMATH DE number 7643406
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs |
scientific article; zbMATH DE number 7643406 |
Statements
A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs (English)
0 references
18 January 2023
0 references
