A Note on Dijkstra's Shortest Path Algorithm

DOI10.1145/321765.321768zbMath0265.68026OpenAlexW2092330486MaRDI QIDQ5681531

Donald B. Johnson

Publication date: 1973

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321765.321768

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (15)

Shortest‐path methods: Complexity, interrelations and new propositions ⋮ Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs ⋮ DEA‐based centralized resource allocation with network flows ⋮ Controller placement problem in software‐defined networking: A survey ⋮ A method for computing heuristics in problem solving ⋮ Parallel algorithms for the single source shortest path problem ⋮ An algorithm for the determination of longest distances in a graph ⋮ Hybrid Bellman-Ford-Dijkstra algorithm ⋮ Decomposition algorithms for finding the shortest path between a source node and a sink node of a network ⋮ Shortest-path algorithms: Taxonomy and annotation ⋮ On the complexity of admissible search algorithms ⋮ A COVERING PROJECTION FOR ROBOT NAVIGATION UNDER STRONG ANISOTROPY ⋮ Energy-optimal routes for battery electric vehicles ⋮ Application of angle related cost function optimization for dynamic path planning algorithm ⋮ A heuristic search algorithm with modifiable estimate

This page was built for publication: A Note on Dijkstra's Shortest Path Algorithm