A Systolic Design for Connectivity Problems

DOI10.1109/TC.1984.5009318MaRDI QIDQ3309077zbMATH OpenFDO

Authors Carla D. Savage

Publication date 1984

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1984.5009318

zbMATH Keywords

graph connectivitysystolic arraystransitive closureunion-find data structureVLSI algorithms

Mathematics Subject Classification ID

Connectivity (05C40) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Cited in

(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

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