Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier (Q2969037)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier |
scientific article |
Statements
22 March 2017
0 references
shortest paths
0 references
dynamic algorithms
0 references
Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier (English)
0 references
