1. Bellman RE (1958) On a routing problem. Quart Appl Math 16:87–90
2. Chartrand G (1985) The konigsberg bridge problem: an introduction to eulerian graphs. Introductory Graph Theory, Dover
3. Cherkassky BV, Goldberg AV, Radzik T (1996) Shortest paths algorithms: theory and experimental evaluation. Math Program 73:129174
4. Delling D, Goldberg AV, Werneck RF (2011) Shortest paths in road networks: from practice to theory and back. Inf Technol 53:294–301
5. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271