An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path (Q930607): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:42, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path |
scientific article |
Statements
An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path (English)
0 references
1 July 2008
0 references
Algorithms
0 references
Complexity
0 references
Graph algorithms
0 references
Shortest path
0 references
