An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem (Q1044727)
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 5650148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem |
scientific article; zbMATH DE number 5650148 |
Statements
An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem (English)
0 references
18 December 2009
0 references
graph algorithms
0 references
shortest path
0 references
divide and conquer
0 references
0.9848093
0 references
0 references
0.9748895
0 references
0.9724802
0 references
0.9723785
0 references
0.94764566
0 references
0.94747293
0 references
0.9472803
0 references
