An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path (Q930607)
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 5294789
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path |
scientific article; zbMATH DE number 5294789 |
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
0 references
