An algorithm for finding shortest routes from all source nodes to a given destination in general networks
From MaRDI portal
Publication:5608702
DOI10.1090/qam/253822zbMath0207.54903MaRDI QIDQ5608702
Publication date: 1970
Published in: Quarterly of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/qam/253822
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A comparison of solution strategies for biobjective shortest path problems, Weighted min cost flows, Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints, New algorithms for multi objective shortest path problem.