1. Network Flows;Ahuja,1993
2. On the exponent of the all pairs shortest path problem;Alon,1991
3. On a routing problem;Bellman;Quart. Appl. Math.,1958
4. P. A. Bloniarz, A. Meyer, M. Fischer, Some observations on Spira's shortest path algorithm, 79-6, Comp. Sci. Dept. State University of New York at Albany, Albany, NY, 1979
5. A shortest path algorithm with expected timeOn2nn;Bloniarz;SIAM J. Comput.,1983