Graph Problems on a Mesh-Connected Processor Array
DOI10.1145/828.322449zbMATH Open0629.68073OpenAlexW2027003016MaRDI QIDQ3766876FDOQ3766876
Authors: S. R. 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
Recommendations
- Solving tree problems on a mesh-connected processor array
- scientific article; zbMATH DE number 1985710
- Parallel algorithms for connectivity problems in graph theory
- Parallel computations on graphs
- scientific article; zbMATH DE number 1057773
- Parallel computations on a graph
- Parallel graph algorithms for hypercube computers
- scientific article; zbMATH DE number 3930349
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
minimum spanning treeadjacency matrixbreadth-first searchgraph algorithmsbridgesparallel computationsgraph 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)
Cited In (16)
- Leftmost one computation on meshes with row broadcasting
- Title not available (Why is that?)
- A simple systolic method to find all bridges of an undirected graph
- Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system
- Dynamic computational geometry on meshes and hypercubes
- Solving visibility and separability problems on a mesh-of-processors
- A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation
- Computational geometry algorithms for the systolic screen
- Solving visibility problems on MCCs of smaller size
- Parallel geometric algorithms on a mesh-connected computer
- Solving tree problems on a mesh-connected processor array
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees
- Prallel algorithms for analyzing activity networks
- Solving cheap graph problems on Meshes
- Solving some combinatorial problems on arrays with one-way dataflow
- Algorithms for some graph problems on a distributed computational model
This page was built for publication: Graph Problems on a Mesh-Connected Processor Array
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3766876)
