Faster deterministic worst-case fully dynamic all-pairs shortest paths via decremental hop-restricted shortest paths (Q6538529)
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: Faster deterministic worst-case fully dynamic all-pairs shortest paths via decremental hop-restricted shortest paths |
scientific article; zbMATH DE number 7847964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster deterministic worst-case fully dynamic all-pairs shortest paths via decremental hop-restricted shortest paths |
scientific article; zbMATH DE number 7847964 |
Statements
Faster deterministic worst-case fully dynamic all-pairs shortest paths via decremental hop-restricted shortest paths (English)
0 references
14 May 2024
0 references
