1 |
Dijkstra, E. W., 'A note on two problems in connexion with graphs,' Numerische Mathematik 1 (1959), 269-271
DOI
|
2 |
Karger, D. R., D. Koller, and S. J. Phillips, 'Finding the hidden path: Time bounds for all-pairs shortest paths,' SIAM Journal on Computing 22, 6(1993), 1199-1217
DOI
ScienceOn
|
3 |
Lawler, E. L., Combinatorial Optimization: Networks and Matrioids, Holt, Rinehart, and Winston, 1976
|
4 |
McGeoch, C. C, 'All-pairs shortest paths and the essential subgraph,' Algorithmica 13 (1995), 426-441
DOI
|
5 |
Johnson, D. B., 'Efficient algorithms for shortest paths in sparse networks,' Journal of the ACM 24, 1 (1977), 1-13
DOI
|
6 |
Bellman, R., 'On a routing problem,' Quarterly of Applied Mathematics 16, 1 (1958), 87-90
DOI
|
7 |
Ford, L. R. Jr. and D. R. Fulkerson, Flows in Networks, Princeton University Press, 1962
|