A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$ (Q3670595)
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 3825203
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$ |
scientific article; zbMATH DE number 3825203 |
Statements
A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$ (English)
0 references
1983
0 references
nonnegatively weighted directed graph
0 references
shortest path
0 references
expected time
0 references
average time
0 references
