1. Leng, J.F., Zeng, W.: An Improved Shortest Path Algorithm for Computing One-to-One Shortest Paths on Road Networks. In: Fac. of Inf. Eng., China Univ. of Geosci., April 26. IEEE, Wuhan (2010)
2. Kaplan, H., Lewenstein, H., Shafrir, N., Sviridenko, M.: Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. In: Proc. 44th on Foundations of Comput. Sci., pp. 56–65. IEEE, Los Alamitos (2004)
3. Retvari, G., Biro, J., Cinkler, T.: On Shortest Path Representation. IEEE/ACM Transactions on Networking 15(6), 1293 (2007)
4. Joe Prathap, P.M., Brindha, G.R.: An Innovative TESOR Algorithm for Perfect Routing. In: International Conference on Signal Processing, Communication, Computing and Network Technologies, NCACNSP (2011) (accepted for publication)
5. Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. Journal of Mathematical Analysis and Applications 14(3), 493–498 (1966)