1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows. Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
2. B. V. Cherkassy, A. V. Goldberg, and T. Radzik. Shortest path algorithms: Theory and experimental evaluation. Math. Programming, 73:129–174, 1996.
3. R. Dechter and J. Pearl. Generalized best-first search strategies and the optimality of A*. J. Assoc. Comp. Mach., 32(3):505–536, 1985.
4. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs with applications. SIAM J. Comput., 16:1004–1022, 1987.
5. M. Gondran and M. Minoux. Graphs and Algorithms. John Wiley & Sons, New York, 1984.