Fully dynamic all-pairs shortest paths: breaking the \(O(n)\) barrier (Q2969037)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6696492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fully dynamic all-pairs shortest paths: breaking the \(O(n)\) barrier |
scientific article; zbMATH DE number 6696492 |
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
0.8706969022750854
0 references
0.8572731614112854
0 references
0.8562123775482178
0 references
0.8389934301376343
0 references
0.83880615234375
0 references
