Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½ N 3 Additions and

DOI10.1145/321707.321712zbMATH Open0242.94028OpenAlexW2061135810MaRDI QIDQ5653927FDOQ5653927

Authors: Jin Y. Yen 

Publication date: 1972

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321707.321712

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Cited In (3)

• An introduction to parallel dynamic programming
• Shortest-path algorithms: Taxonomy and annotation
• A priority queue for the all pairs shortest path problem

This page was built for publication: Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½ N ³ Additions and

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5653927)