A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs

DOI10.1016/0377-2217(83)90158-3zbMath0502.90083OpenAlexW2074250490MaRDI QIDQ1173022

S. Jeyaratnam

Publication date: 1983

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(83)90158-3

zbMATH Keywords

shortest pathDijkstra's algorithmdirected nonnegatively weighted graphgraph of nonnegative arcs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• The art and theory of dynamic programming
• On the Shortest Route Through a Network
• Finding the Shortest Route between Two Points in a Network
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs