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 the normal view instead:
scientific article; zbMATH DE number 5686483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths |
scientific article; zbMATH DE number 5686483 |
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
0.9290095567703248
0 references
0.9178802967071532
0 references
0.8923398852348328
0 references
0.8913843631744385
0 references
0.8794699311256409
0 references
