论文信息 - A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm - 字舞流文

A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm

Kohei Noshita | K. Noshita

[1] Peter A. Bloniarz,et al. A shortest-path algorithm with expected time O(n2 log n log* n) , 1980, STOC '80.

[2] Victor Klee,et al. Combinatorial Optimization: What is the State of the Art , 1980, Math. Oper. Res..

[3] Kohei Noshita,et al. On the Expected Behaviors of the Dijkstra's Shortest Path Algorithm for Complete Graphs , 1978, Inf. Process. Lett..

[4] Donald B. Johnson,et al. Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[5] Michael L. Fredman,et al. New Bounds on the Complexity of the Shortest Path Problem , 1976, SIAM J. Comput..

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[7] Philip M. Spira,et al. A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n2 log2n) , 1973, SIAM J. Comput..

[8] Ellis L. Johnson. On shortest paths and sorting , 1972, ACM Annual Conference.

[9] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[10] R. Prim. Shortest connection networks and some generalizations , 1957 .