1. 9th DIMACS Implementation Challenge. http://www.dis.uniroma1.it/challenge9/download.shtml
2. Ahuja, R.K., et al.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall Inc, London (1993)
3. Cormen, T.H., et al.: Introduction to Algorithms. The MIT Press, Cambridge (2000)
4. Garey, M.S., Johnson, D.S.: Computers and Intractability: Guide to the Theory of NP-Completeness. (Ed by, W.H. Freeman), New York (1979)
5. Goldberg, A.V., Chris, H.: Computing the shortest path: a search meets graph theory. In: SODA 2005 (2005)