Affiliation:
1. Department of Computer Science, Cornell University, Ithaca, New York
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
192 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献