Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using 12N3 Additions and N3 Comparisons

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using 12N³ Additions and N³ Comparisons

Full text

Pdf (71 KB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 3 (July 1972) table of contents

Pages: 423 - 424

Year of Publication: 1972

ISSN:0004-5411

Author

Jin Y. Yen

University of Santa Clara, Graduate School of Business, Santa Clara, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 46, Citation Count: 6

Additional Information:

references cited by index terms peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321707.321712 What is a DOI?

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.

DREYFUS, S.E. An appraisal of some shortest path algorithms. Operat. Res. 17, 3 (May 1969), 395--412.

CITED BY 6

	Jin Y. Yen, Reply to Williams and White's Note, Journal of the ACM (JACM), v.20 n.3, p.390, July 1973
	Thomas A. Williams , Gregory P. White, A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N-Node Nonnegative-Distance Networks, Journal of the ACM (JACM), v.20 n.3, p.389-390, July 1973
	R. R. Chen , Y. Kajitani, The channel expansion problem in layout design, Proceedings of the 21st conference on Design automation, p.388-391, June 25-27, 1984, Albuquerque, New Mexico, United States
	Robert A. Wagner, A Shortest Path Algorithm for Edge-Sparse Graphs, Journal of the ACM (JACM), v.23 n.1, p.50-57, Jan. 1976
	Peter Bloniarz, A shortest-path algorithm with expected time O(n2 log n log* n), Proceedings of the twelfth annual ACM symposium on Theory of computing, p.378-384, April 28-30, 1980, Los Angeles, California, United States
	Donald B. Johnson, Efficient Algorithms for Shortest Paths in Sparse Networks, Journal of the ACM (JACM), v.24 n.1, p.1-13, Jan. 1977