Shortest path algorithms using dynamic breadth-first search

This publication has 9 references indexed in Scilit:

• Efficient Shortest Path Simplex Algorithms
  Operations Research, 1990
• Anti‐stalling pivot rules for the network simplex algorithm
  Networks, 1990
• A note on the partitioning shortest path algorithm
  Operations Research Letters, 1987
• A New Polynomially Bounded Shortest Path Algorithm
  Operations Research, 1985
• Shortest‐path algorithms: Taxonomy and annotation
  Networks, 1984
• Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956–1974)
  Networks, 1975
• An algorithm for finding shortest routes from all source nodes to a given destination in general networks
  Quarterly of Applied Mathematics, 1970
• An Appraisal of Some Shortest-Path Algorithms
  Operations Research, 1969
• On a routing problem
  Quarterly of Applied Mathematics, 1958