A Systolic Design for Connectivity Problems
From MaRDI portal
Publication:3309077
DOI10.1109/TC.1984.5009318zbMath0528.68045MaRDI QIDQ3309077
Publication date: 1984
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Algorithms in computer science (68W99)
Related Items (2)
Parallel algorithms for shortest path problems in polygons ⋮ A linear systolic algorithm for the connected component problem
This page was built for publication: A Systolic Design for Connectivity Problems