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 |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/0216065 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2054523876 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 21:13, 19 March 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