An orthogonal systolic array for the algebraic path problem
This paper is devoted to the design of an orthogonal systolic array of \(n(n+1)\) elementary processors which can solve any instance of the Algebraic Path Problem within only 5n-2 time steps, and is compared with the 7n-2 time steps of the hexagonal systolic array of \textit{G. Rote} [Computing 34, 191-219 (1985; Zbl 0546.68047)].
scientific article; zbMATH DE number 4003536