An \(O(n ^{3} \log\log n/\log ^{2} n)\) time algorithm for all pairs shortest paths (Q2904549)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(n ^3 n/ ^2 n) time algorithm for all pairs shortest paths |
scientific article; zbMATH DE number 6065664
| 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 6065664 |
Statements
An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths (English)
0 references
14 August 2012
0 references
algorithms
0 references
all-pairs shortest paths
0 references
graph algorithms
0 references
upper bounds
0 references
0.9905831813812256
0 references
0.9446325302124025
0 references
0.9410922527313232
0 references
0.9290095567703248
0 references
0.910746455192566
0 references
