New Bounds on the Complexity of the Shortest Path Problem

This publication has 6 references indexed in Scilit:

• How good is the information theory bound in sorting?
  Theoretical Computer Science, 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
• Efficient determination of the transitive closure of a directed graph
  Information Processing Letters, 1971
• Algorithm 97: Shortest path
  Communications of the ACM, 1962
• A note on two problems in connexion with graphs
  Numerische Mathematik, 1959
• Partition of Space
  The American Mathematical Monthly, 1943