Thumbnail
Access Restriction
Subscribed

Author Johnson, Donald B.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1973
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract An assertion that Dijkstra's algorithm for shortest paths (adapted to allow arcs of negative weight) runs in $\textit{O}(\textit{n}3)$ steps is disproved by showing a set of networks which take $\textit{O}(\textit{n}2\textit{n})$ steps.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1973-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 20
Issue Number 3
Page Count 4
Starting Page 385
Ending Page 388


Open content in new tab

   Open content in new tab
Source: ACM Digital Library