Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½ N 3 Additions and
From MaRDI portal
Publication:5653927
DOI10.1145/321707.321712zbMath0242.94028OpenAlexW2061135810MaRDI QIDQ5653927
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
Related Items
Shortest-path algorithms: Taxonomy and annotation, A priority queue for the all pairs shortest path problem