Pages that link to "Item:Q3893326"
From MaRDI portal
The following pages link to Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer (Q3893326):
Displaying 22 items.
- Dynamic computational geometry on meshes and hypercubes (Q547490) (← links)
- Determining maximum \(k\)-width-connectivity on meshes (Q685604) (← links)
- Leftmost one computation on meshes with row broadcasting (Q688236) (← links)
- Graph algorithms on a tree-structured parallel computer (Q797290) (← links)
- Parallel general prefix computations with geometric, algebraic, and other applications (Q916378) (← links)
- A linear systolic algorithm for the connected component problem (Q1123585) (← links)
- A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation (Q1123611) (← links)
- Computing convexity properties of images on a pyramid computer (Q1175644) (← links)
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays (Q1175647) (← links)
- Computational geometry algorithms for the systolic screen (Q1175650) (← links)
- Topological numbering of features on a mesh (Q1175652) (← links)
- Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays (Q1176071) (← links)
- Parallel asynchronous connected components in a mesh (Q1178235) (← links)
- The calculation of average distance in mesh structures. (Q1416347) (← links)
- Parallel geometric algorithms on a mesh-connected computer (Q1825643) (← links)
- Fast connected-component labeling (Q2270831) (← links)
- The balanced binary tree technique on mesh-connected computers (Q2638775) (← links)
- Solving visibility problems on MCCs of smaller size (Q2638829) (← links)
- New fast parallel algorithm for the connected component problem and its VLSI implementation (Q3358233) (← links)
- TIME-OPTIMAL ALGORITHMS FOR GENERALIZED DOMINANCE COMPUTATION AND RELATED PROBLEMS ON MESH CONNECTED COMPUTERS AND MESHES WITH MULTIPLE BROADCASTING (Q4820157) (← links)
- Computing minimum spanning forests on 1- and 2-dimensional processor arrays (Q5096153) (← links)
- Parallel computation of discrete Voronoi diagrams (Q5096154) (← links)
