Information Bounds Are Weak in the Shortest Distance Problem
- 1 July 1980
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 27 (3) , 428-444
- https://doi.org/10.1145/322203.322206
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- On the Polyhedral Decision ProblemSIAM Journal on Computing, 1980
- Efficient determination of the transitive closure of a directed graphInformation Processing Letters, 1971
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959