Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization (Q2816298)
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: Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization |
scientific article; zbMATH DE number 6600659
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization |
scientific article; zbMATH DE number 6600659 |
Statements
4 July 2016
0 references
dynamic graph algorithms
0 references
all-pairs shortest paths
0 references
derandomization
0 references
emulator
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization (English)
0 references
