Shortest path algorithms

This publication has 24 references indexed in Scilit:

• Shortest path methods: A unifying approach
  Published by Springer Nature ,1986
• Computational study of an improved shortest path algorithm
  Networks, 1984
• Data Structures and Network Algorithms
  Published by Society for Industrial & Applied Mathematics (SIAM) ,1983
• A new algorithm to find the shortest paths between all pairs of nodes
  Discrete Applied Mathematics, 1982
• A dual simplex algorithm for finding all shortest paths
  Networks, 1981
• Properties of Labeling Methods for Determining Shortest Path Trees
  Journal of Research of the National Bureau of Standards, 1981
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
  Networks, 1979
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
  Operations Research, 1979
• A Dual Shortest Path Algorithm
  SIAM Journal on Applied Mathematics, 1974
• A note on two problems in connexion with graphs
  Numerische Mathematik, 1959