VLSI Algorithms for the Connected Component Problem

DOI10.1137/0212023zbMath0512.68047OpenAlexW2051172556MaRDI QIDQ3657443

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

connected componentsarea-time tradeoffsd-dimensional meshes

Mathematics Subject Classification ID

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

Related Items (4)

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

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