A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs (Q5060135)
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 all-pairs shortest paths in planar graphs |
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