A Note on Dijkstra's Shortest Path Algorithm

DOI10.1145/321765.321768MaRDI QIDQ5681531zbMATH OpenOpenAlexFDO

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

Cited in

(18)

• A method for computing heuristics in problem solving
• Parallel algorithms for the single source shortest path problem
• On the complexity of admissible search algorithms
• Energy-optimal routes for battery electric vehicles
• Application of angle related cost function optimization for dynamic path planning algorithm
• A covering projection for robot navigation under strong anisotropy
• Decomposition algorithms for finding the shortest path between a source node and a sink node of a network
• Shortest-path algorithms: Taxonomy and annotation
• Shortest‐path methods: Complexity, interrelations and new propositions
• Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
• An algorithm for the determination of longest distances in a graph
• Hybrid Bellman-Ford-Dijkstra algorithm
• DEA‐based centralized resource allocation with network flows
• Controller placement problem in software‐defined networking: A survey
• On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms
• Optimal transport in non-convex geometries and its application in shrinkage porosity prediction
• A fast and simple algorithm for the resource constrained shortest path problem
• A heuristic search algorithm with modifiable estimate

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

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