A Note on Spira’s Algorithm for the All-Pairs Shortest-Path Problem
- 1 December 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (4) , 696-699
- https://doi.org/10.1137/0206050
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$SIAM Journal on Computing, 1973
- Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½
N
3
Additions and
N
3
ComparisonsJournal of the ACM, 1972
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- AlgorithmsCommunications of the ACM, 1964
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959