A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs (Q6575219)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7883719
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs |
scientific article; zbMATH DE number 7883719 |
Statements
A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs (English)
0 references
19 July 2024
0 references
