A Dual Shortest Path Algorithm

DOI10.1137/0126047zbMath0251.90051OpenAlexW2015648019MaRDI QIDQ5665033

Robert W. Langley, Mokhtar S. Bazaraa

Publication date: 1974

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0126047

Mathematics Subject Classification ID

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

Related Items (5)

Algorithms for finding k-best perfect matchings ⋮ A new algorithm to find the shortest paths between all pairs of nodes ⋮ An auction-based approach for the re-optimization shortest path tree problem ⋮ Shortest paths on dynamic graphs ⋮ An improvement of Dijkstra's method for finding a shortest path in a graph

This page was built for publication: A Dual Shortest Path Algorithm