scientific article; zbMATH DE number 4185046

MaRDI QIDQ5750414zbMATHFDO

Authors

Publication date 1989

zbMATH Keywords

systolic systemtransitive closure/shortest path problems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Cellular automata (computational aspects) (68Q80)

Recommendations

• Computing transitive closure on systolic arrays of fixed size
• Numerical Analysis and Its Applications
• An improved systolic algorithm for the algebraic path problem
• scientific article; zbMATH DE number 4058886
• scientific article; zbMATH DE number 64177
• Derivation of systolic algorithms for the algebraic path problem by recurrence transformations
• Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
• Systolic algorithms for some scheduling and graph problems
• scientific article; zbMATH DE number 3870611

Cited in

(2)

• Numerical Analysis and Its Applications
• Computing transitive closure on systolic arrays of fixed size

This page was built for publication:

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