A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$
From MaRDI portal
Publication:3670595
DOI10.1137/0212039zbMath0521.68078MaRDI QIDQ3670595
Publication date: 1983
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0212039
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
Related Items
Unnamed Item, Unnamed Item, A priority queue for the all pairs shortest path problem, Shortest paths in networks with vector weights, All-pairs shortest paths and the essential subgraph