Graph Problems on a Mesh-Connected Processor Array
From MaRDI portal
Publication:3766876
DOI10.1145/828.322449zbMath0629.68073OpenAlexW2027003016MaRDI QIDQ3766876
S. Rao Kosaraju, Mikhail J. Atallah
Publication date: 1984
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/828.322449
adjacency matrixgraph algorithmsminimum spanning treeparallel computationsbridgesbreadth-first searchgraph problemsarticulation pointslength of a shortest cyclen\(\times n\) array of processors
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Prallel algorithms for analyzing activity networks ⋮ Solving visibility problems on MCCs of smaller size ⋮ A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation ⋮ Computational geometry algorithms for the systolic screen ⋮ A simple systolic method to find all bridges of an undirected graph ⋮ Dynamic computational geometry on meshes and hypercubes ⋮ Algorithms for some graph problems on a distributed computational model ⋮ Solving some combinatorial problems on arrays with one-way dataflow ⋮ Parallel geometric algorithms on a mesh-connected computer ⋮ An adaptive and cost-optimal parallel algorithm for minimum spanning trees
