1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley Pub., Reading, MA, 1974.
2. Y. C. Bang, S. Radhakrishnan, N. S. V. Rao, and S. G. Batsell, On update algorithms for quickest paths, Computer Communications, vol 23, pp. 1064–1068, 2000.
3. G. H. Chen and Y. C. Hung, On the quickest path problem, Information Processing Letters, vol 46, pp. 125–128, 1993.
4. Y. L. Chen and Y. H. Chin, The quickest path problem, Computers and Operations Research, vol. 17, no. 2, pp. 53–161, 1990.
5. W. C. Grimmell and N. S. V. Rao, On source-based route computation for quickest paths under dynamic bandwidth constraints, Journal of Foundations of Computer Science, 2002, in press.