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

DOI10.1016/0166-218X(83)90104-XMaRDI QIDQ1053460zbMATH OpenWikidataFDO

Authors 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)

Cites work

• A note on two problems in connexion with graphs
• A priority queue in which initialization and queue operations takeO(loglogD) time
• An O(m log D) algorithm for shortest paths
• Design and implementation of an efficient priority queue
• Preserving order in a forest in less than logarithmic time and linear space

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1053460)