Allowable processing orders in the accelerated cascade algorithm (Q1072941)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Allowable processing orders in the accelerated cascade algorithm |
scientific article; zbMATH DE number 3943581
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Allowable processing orders in the accelerated cascade algorithm |
scientific article; zbMATH DE number 3943581 |
Statements
Allowable processing orders in the accelerated cascade algorithm (English)
0 references
1986
0 references
We deal with the 'accelerated' version of \textit{O. Bilde} and \textit{J. Krarup} [Metra 8, 231-241 (1969)] of the 'all shortest distances' cascade algorithm due to \textit{B. A. Farbey, A. H. Land} and \textit{J. D. Murchland} [Manage. Sci., Theory 14, 19-28 (1967; Zbl 0183.236)]. 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 \textit{T. C. Hu} [SIAM J. Appl. Math. 15, 207-218 and 1517 (1967; Zbl 0158.154)] for the original algorithm, and in particular imply that the simple processing order of the original algorithm remains admissible for the accelerated version.
0 references
accelerated version
0 references
all shortest distances cascade algorithm
0 references
processing-order for distance-matrix entries
0 references
0.8168323
0 references
0.8152276
0 references
0.8150256
0 references
0.81501365
0 references
0.81433356
0 references
0.8135718
0 references
0.8135718
0 references
0.8128117
0 references
