Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
From MaRDI portal
Publication:3893326
DOI10.1137/0209058zbMath0447.68070OpenAlexW2039866832MaRDI QIDQ3893326
David Nassimi, Sartaj K. Sahni
Publication date: 1980
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0209058
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Theory of software (68N99)
Related Items (22)
The balanced binary tree technique on mesh-connected computers ⋮ Solving visibility problems on MCCs of smaller size ⋮ TIME-OPTIMAL ALGORITHMS FOR GENERALIZED DOMINANCE COMPUTATION AND RELATED PROBLEMS ON MESH CONNECTED COMPUTERS AND MESHES WITH MULTIPLE BROADCASTING ⋮ A linear systolic algorithm for the connected component problem ⋮ A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation ⋮ Computing minimum spanning forests on 1- and 2-dimensional processor arrays ⋮ Parallel computation of discrete Voronoi diagrams ⋮ The calculation of average distance in mesh structures. ⋮ Parallel general prefix computations with geometric, algebraic, and other applications ⋮ Computing convexity properties of images on a pyramid computer ⋮ Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays ⋮ Computational geometry algorithms for the systolic screen ⋮ Topological numbering of features on a mesh ⋮ Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays ⋮ Parallel asynchronous connected components in a mesh ⋮ Determining maximum \(k\)-width-connectivity on meshes ⋮ Leftmost one computation on meshes with row broadcasting ⋮ Dynamic computational geometry on meshes and hypercubes ⋮ Fast connected-component labeling ⋮ New fast parallel algorithm for the connected component problem and its VLSI implementation ⋮ Parallel geometric algorithms on a mesh-connected computer ⋮ Graph algorithms on a tree-structured parallel computer
This page was built for publication: Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
