A theorem on the expected complexity of dijkstra's shortest path algorithm

This publication has 7 references indexed in Scilit:

• A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$
  SIAM Journal on Computing, 1983
• Combinatorial Optimization: What is the State of the Art
  Mathematics of Operations Research, 1980
• On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs
  Information Processing Letters, 1978
• Efficient Algorithms for Shortest Paths in Sparse Networks
  Journal of the ACM, 1977
• New Bounds on the Complexity of the Shortest Path Problem
  SIAM Journal on Computing, 1976
• A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$
  SIAM Journal on Computing, 1973
• A note on two problems in connexion with graphs
  Numerische Mathematik, 1959