An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$ (Q3801096)
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 4068318
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$ |
scientific article; zbMATH DE number 4068318 |
Statements
An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$ (English)
0 references
1987
0 references
computational complexity
0 references
average time
0 references
heap
0 references
all pairs shortest path
0 references
weighted directed graph
0 references
random graphs
0 references
endpoint independent graphs
0 references
0.8727080821990967
0 references
0.8714461326599121
0 references
0.8710432052612305
0 references
