1. Corneil, D.: Lexicographic breadth first search: A survey. Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol. 3353, pp. 1–19. Springer, Berlin, Heidelberg (2005)
2. Demetrescu, C., Goldberg, A., Johnson, D.: 9th DIMACS implementation challenge-shortest paths (2006). www.dis.uniroma1.it/challenge9/
3. Dongarra, J.J.: Performance of various computers using standard linear equations software. Technical report CS-89-85, University of Tennessee, USA (2013)
4. Dumitrescu, I., Boland, N.: Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42(3), 135–153 (2003)
5. Handler, G.Y., Zang, I.: A dual algorithm for the constrained shortest path problem. Networks 10(4), 293–309 (1980)