A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time (Q1944395)
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: A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time |
scientific article; zbMATH DE number 6148673
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time |
scientific article; zbMATH DE number 6148673 |
Statements
A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time (English)
0 references
25 March 2013
0 references
algorithm
0 references
all pairs shortest paths
0 references
expected time
0 references
priority queue
0 references
0 references
0.9949002
0 references
0.9778855
0 references
0.94884795
0 references
0.9472803
0 references
0.94707316
0 references
0.94021255
0 references
0.93981606
0 references
0.9368125
0 references
