An O(m log log D) algorithm for shortest paths
From MaRDI portal
Publication:1053460
DOI10.1016/0166-218X(83)90104-XzbMath0517.68061WikidataQ56078247 ScholiaQ56078247MaRDI QIDQ1053460
Patricio V. Poblete, Rolf G. Karlsson
Publication date: 1983
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
Related Items
Cites Work
- A note on two problems in connexion with graphs
- An O(m log D) algorithm for shortest paths
- Preserving order in a forest in less than logarithmic time and linear space
- A priority queue in which initialization and queue operations takeO(loglogD) time
- Design and implementation of an efficient priority queue