A block algorithm and optimal fixed-size systolic array processor for the algebraic path problem

DOI10.1007/BF02477180zbMATH Open0717.68077OpenAlexW2090287131WikidataQ61731071 ScholiaQ61731071MaRDI QIDQ5748899FDOQ5748899

Authors: Fernando Núñez, Mateo Valero 

Publication date: 1989

Published in: Journal of VLSI signal processing systems for signal, image and video technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02477180

Recommendations

• scientific article; zbMATH DE number 3954292
• scientific article; zbMATH DE number 64177
• An orthogonal systolic array for the algebraic path problem
• Publication:4728254
• An improved systolic algorithm for the algebraic path problem

zbMATH Keywords

systolic arrayalgebraic path problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Cellular automata (computational aspects) (68Q80) General theory of computer systems (68M01)

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Derivation of systolic algorithms for the algebraic path problem by recurrence transformations
• An orthogonal systolic array for the algebraic path problem
• Synthesis of size-optimal toroïdal arrays for the algebraic path problem: A new contribution
• Computing transitive closure on systolic arrays of fixed size
• An improved systolic algorithm for the algebraic path problem

This page was built for publication: A block algorithm and optimal fixed-size systolic array processor for the algebraic path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5748899)