An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths (Q2904549)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths |
scientific article |
Statements
An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths (English)
0 references
14 August 2012
0 references
algorithms
0 references
all-pairs shortest paths
0 references
graph algorithms
0 references
upper bounds
0 references
