New algorithms and hardness for incremental single-source shortest paths in directed graphs (Q5144905)
From MaRDI portal
scientific article; zbMATH DE number 7298238
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New algorithms and hardness for incremental single-source shortest paths in directed graphs |
scientific article; zbMATH DE number 7298238 |
Statements
New algorithms and hardness for incremental single-source shortest paths in directed graphs (English)
0 references
19 January 2021
0 references
conditional lower bound
0 references
dynamic algorithm
0 references
shortest path
0 references
single source shortest path
0 references
