A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths (Q2380054)
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 note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths |
scientific article |
Statements
A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths (English)
0 references
24 March 2010
0 references
analysis of algorithms
0 references
complexity
0 references
graph algorithms
0 references
shortest path
0 references
0 references
