ACM Home Page
Please provide us with feedback. Feedback
A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N-Node Nonnegative-Distance Networks
Full text PdfPdf (101 KB)
Source Journal of the ACM (JACM) archive
Volume 20 ,  Issue 3  (July 1973) table of contents
Pages: 389 - 390  
Year of Publication: 1973
ISSN:0004-5411
Authors
Thomas A. Williams  Department of Quantitative Analysis, University of Cincinnati, Cincinnati, Ohio
Gregory P. White  Department of Quantitative Analaysis, University of Cincinnati, Cincinnati, Ohio
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 73,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321765.321769
What is a DOI?

ABSTRACT

An error in Yen's algorithm is pointed out, and an alternative is offered which will produce correct results.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1

Collaborative Colleagues:
Thomas A. Williams: colleagues
Gregory P. White: colleagues