An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:01, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths |
scientific article |
Statements
An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (English)
0 references
9 December 2016
0 references
algorithms
0 references
all pairs shortest paths
0 references
graph algorithms
0 references
upper bounds
0 references
