论文信息 - A Note on Dijkstra's Shortest Path Algorithm

A Note on Dijkstra's Shortest Path Algorithm

An assertion that Dijkstra's algorithm for shortest paths (adapted to allow arcs of negative weight) runs in <italic>O</italic>(<italic>n</italic><supscrpt>3</supscrpt>) steps is disproved by showing a set of networks which take <italic>O</italic>(<italic>n</italic>2<supscrpt><italic>n</italic></supscrpt>) steps.

Donald B. Johnson | Donald B. Johnson

[1] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[2] Journal of the Association for Computing Machinery , 1961, Nature.

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