Efficient Algorithms for Shortest Paths in Sparse Networks
暂无分享,去创建一个
[1] Donald B. Johnson,et al. A Note on Dijkstra's Shortest Path Algorithm , 1973, JACM.
[2] G. Nemhauser. A generalized permanent label setting algorithm for the shortest path between specified nodes , 1972 .
[3] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[4] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[5] Michael L. Fredman,et al. New Bounds on the Complexity of the Shortest Path Problem , 1976, SIAM J. Comput..
[6] Ellis L. Johnson. On shortest paths and sorting , 1972, ACM Annual Conference.
[7] J. Ian Munro,et al. Sorting and Searching in Multisets , 1976, SIAM J. Comput..
[8] W. W. Bledsoe,et al. Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub. , 1971, SGAR.
[9] T. C. Hu,et al. Shortcut in the decomposition algorithm for shortest paths in a network , 1969 .
[10] Journal of the Association for Computing Machinery , 1961, Nature.
[11] Robert A. Wagner,et al. A Shortest Path Algorithm for Edge-Sparse Graphs , 1976, J. ACM.
[12] G. Dantzig. On the Shortest Route Through a Network , 1960 .
[13] Alan J. Hoffman,et al. Finding all shortest distances in a directed network , 1972 .
[14] George B. Dantzig,et al. ALL SHORTEST ROUTES IN A GRAPH , 1966 .
[15] G. Dantzig,et al. ALL SHORTEST ROUTES FROM A FIXED ORIGIN IN A GRAPH , 1966 .
[16] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.
[17] Donald E. Knuth,et al. The art of computer programming: V.1.: Fundamental algorithms , 1997 .
[18] Michael L. Fredman,et al. On the decision tree complexity of the shortest path problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[19] Jaroslav Morávek,et al. A note upon minimal path problem , 1970 .
[20] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[21] Melvin J. Jacobson. The finite length partial fitted journal bearing with axial oil groove , 1958 .
[22] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[23] A. Pierce. Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956-1974) , 1975, Networks.
[24] Jin Y. Yen,et al. Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using 12N3 Additions and N3 Comparisons , 1972, JACM.
[25] Donald B. Johnson,et al. Priority Queues with Update and Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..
[26] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[27] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[28] J. Y. Yen. An algorithm for finding shortest routes from all source nodes to a given destination in general networks , 1970 .