An assertion that Dijkstra's algorithm for shortest paths (adapted to allow arcs of negative weight) runs in O ( n 3 ) steps is disproved by showing a set of networks which take O ( n 2 n ) steps.
No takes yet. Share an insight, caveat, or question.
D. Barton Johnson (1973) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: