1. On a routing problem;Bellman;Quart. Appl. Math.,1958
2. Flows in Networks;Ford,1962
3. The shortest path through a maze;Moore,1959
4. Scaling algorithms for the shortest paths problem;Goldberg;Proc. 4nd ACM-SIAM Symposium on Discrete Algorithms,1993
5. Implementation and efficiency of Moore algorithms for the shortest root problem;Pape;Math. Prog.,1974