An O(m log log D) algorithm for shortest paths

DOI10.1016/0166-218X(83)90104-XzbMath0517.68061WikidataQ56078247 ScholiaQ56078247MaRDI QIDQ1053460

Rolf G. Karlsson, Patricio V. Poblete

Publication date: 1983

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

priority queueDijkstra's shortest path algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Computation of shortest path in cellular automata ⋮ A spectral approach to the shortest path problem

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

This page was built for publication: An O(m log log D) algorithm for shortest paths