An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$ (Q3801096): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:16, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$ |
scientific article |
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
