论文信息 - Allowable processing orders in the accelerated cascade algorithm

Allowable processing orders in the accelerated cascade algorithm

Abstract We deal with the ‘accelerated’ version (Bilde and Krarup, 1969) of the ‘all shortest distances’ Cascade Algorithm (Farbey et al., 1967). A set of weakest possible conditions on the processing-order for distance-matrix entries, under which the Bilde-Krarup acceleration remains valid, is determined. These conditions are weaker than those of Hu (1967) for the original algorithm, and in particular imply that the simple processing order of the original algorithm remains admissible for the accelerated version.

Prasoon Tiwari | A. J. Goldman | Prasoon Tiwari

[1] T. C. Hu. Revised Matrix Algorithms for Shortest Paths , 1967 .

[2] L. R. Kerr. The Effect of Algebraic Structure on the Computational Complexity of Matrix Multiplication , 1970 .

[3] Mario Nakamori. A NOTE ON THE OPTIMALITY OF SOME ALL-SHORTEST-PATH ALGORITHMS , 1972 .

[4] Theorie [i.e. Theory] of matrix algorithms , 1974 .

[5] George B. Dantzig,et al. ALL SHORTEST ROUTES IN A GRAPH , 1966 .

[6] Daniel J. Lehmann,et al. Algebraic Structures for Transitive Closure , 1976, Theor. Comput. Sci..

[7] Douglas R. Shier,et al. Iterative methods for determining the k shortest paths in a network , 1976, Networks.

[8] S. N. Narahari Pandit,et al. Letter to the Editor---The Shortest-Route Problem---An Addendum , 1961 .

[9] J. D. Murchland,et al. The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph , 1967 .