Solving some combinatorial problems on arrays with one-way dataflow

DOI10.1007/BF01840384zbMath0683.68058OpenAlexW1976675939MaRDI QIDQ1825042

Jo Ellen Perry, Carla D. Savage, Matthias F. M. Stallmann

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

systolic arraysparallel graph algorithmsunidirectional dataflow

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80) Enumerative combinatorics (05A99)

Cites Work

• Maximum matchings and trees
• The expected linearity of a simple equivalence algorithm
• An Efficient Parallel Biconnectivity Algorithm
• Graph Problems on a Mesh-Connected Processor Array
• Efficiency of a Good But Not Linear Set Union Algorithm
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Solving some combinatorial problems on arrays with one-way dataflow