1. Lecture Notes in Computer Science;S. Bleuler,2003
2. Buriol, L.S., Resende, M.G.C., Thorup, M.: Speeding up dynamic shortest path algorithms. INF. J. on Comp. 20(2), 191–204 (2008)
3. Conover, W.J.: Practical non-parametric statistics, 3rd edn. John Wiley and Sons, New York (1999)
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)
5. Costelloe, D., Mooney, P., Winstansley, A.: From random walks to pareto optimal paths. In: Proceedings of the 4th Irish Artificial Intelligence and Cognitive Science Conference, pp. 523–530 (2001)