VLSI Algorithms for the Connected Component Problem

DOI10.1137/0212023MaRDI QIDQ3657443zbMATH OpenOpenAlexFDO

Authors Susanne E. Hambrusch

Publication date 1983

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0212023

zbMATH Keywords

area-time tradeoffsconnected componentsd-dimensional meshes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(4)

• A linear systolic algorithm for the connected component problem
• Topological numbering of features on a mesh
• New fast parallel algorithm for the connected component problem and its VLSI implementation
• Time-optimal simulations of networks by universal parallel computers

This page was built for publication: VLSI Algorithms for the Connected Component Problem

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