A simpler algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time (Q3066458)
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 5834505
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simpler algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time |
scientific article; zbMATH DE number 5834505 |
Statements
A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time (English)
0 references
10 January 2011
0 references
0.9864124059677124
0 references
0.8902869820594788
0 references
0.8661826252937317
0 references
