Parallel algorithms for determining \(k\)-width connectivity in binary images

DOI10.1016/0743-7315(91)90025-5zbMath0753.68045OpenAlexW2104965776MaRDI QIDQ1177080

Susanne E. Hambrusch, Frank Dehne

Publication date: 25 June 1992

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-7315(91)90025-5

zbMATH Keywords

\(k\)-width componentshypercube algorithm

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Distributed algorithms (68W15)

Related Items (1)

Determining maximum \(k\)-width-connectivity on meshes

This page was built for publication: Parallel algorithms for determining \(k\)-width connectivity in binary images