Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler (Q5146945)
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: Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler |
scientific article; zbMATH DE number 7304178
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler |
scientific article; zbMATH DE number 7304178 |
Statements
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler (English)
0 references
2 February 2021
0 references
