1 |
Ion Cozac, "Minimum Cost Path in a Huge Graph", STUDIA UNIV. BABES-BOLYAI, INFORMATICA, vol. XLVII, no. 2, 2002.
|
2 |
Floyd, Robert W., "Algorithm 97: Shortest Path", Communications of the ACM 5(6):345, June 1962, doi:10.1145/367766.368168.
|
3 |
. E. Bellman, On a Routing Problem, Quart. Appl. Math. 16, pp. 87-90, 1958.
DOI
|
4 |
L. R. Ford, and D. R. Fulkerson, Flows in Networks, Princeton Univ. Press, Princeton, NJ, 1962.
|
5 |
Dechter, Rina and Judea Pearl, "Generalized best-first search strategies and the optimality of A*", Journal of the ACM 32(3), pp. 505-536, 1985, doi:10.1145/3828.3830.
DOI
ScienceOn
|
6 |
Zhaoyung Xing, "A Minimum Cost Path Search Algorithm Through Tile Obstacles", ISPD'01 Proceedings of the 2001 International Symposium on Physical Design, 2001.
|
7 |
Weisstein, Eric, "Floyd-Warshall Algorithm", Wolfram MathWorld, Retrieved 13 November 2009.
|
8 |
D.S. Malik and P.S. Mair, Data Structures Using Java, THOMSOM COURSE TECHNOLOGY, pp. 668-694, 2003.
|
9 |
BV Cherkassky, AV Goldberg and T Radzik, Shortest paths algorithms: theory and experimental evaluation, Mathematical programming, 1996.
|
10 |
Dijkstra, E. W., "A note on two problems in connexion with graphs", Numerische Mathematik 1, pp. 269-271, 1959.
DOI
|