An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723)
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 6662313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths |
scientific article; zbMATH DE number 6662313 |
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
0 references
0 references
0.9905831813812256
0 references
0.9422727823257446
0 references
0.9416366815567015
0 references
0.9178802967071532
0 references
0.899885892868042
0 references
