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.54903OpenAlexW2566091043MaRDI 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
Related Items
A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment ⋮ An empirical analysis of privacy in the lightning network ⋮ An integrated approach for scheduling health care activities in a hospital ⋮ Solving the edge‐disjoint paths problem using a two‐stage method ⋮ An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs ⋮ Weighted min cost flows ⋮ Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints ⋮ A new algorithm to compute Pareto-optimal paths in a multi objective fuzzy weighted network ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ New algorithms for multi objective shortest path problem. ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs ⋮ Vertex labeling and routing for Farey-type symmetrically-structured graphs