Graph problems on a mesh-connected processor array (Preliminary Version)

Authors:
Mikhail J. Atallah;S. Rao Kosaraju
Affiliations:
-;-
Venue:
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Year:
1982

Citing 6
Cited 3

A Theorem on Boolean Matrices

Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer

Communications of the ACM
An efficient data structure for dynamic memory management

Journal of Systems and Software
Introduction to VLSI Systems

Introduction to VLSI Systems
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
A cellular computer to implement the kalman filter algorithm

A cellular computer to implement the kalman filter algorithm

Parallel graph algorithms

ACM Computing Surveys (CSUR)
A parallel algorithm for finding a maximum flow in 0-1 networks

CSC '87 Proceedings of the 15th annual conference on Computer Science
A parallel computer based on cube connected cycles for wafer scale integration

ACM '86 Proceedings of 1986 ACM Fall joint computer conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give O(n) step algorithms for solving a number of graph problems on an n-&-times;n array of processors. The problems considered include: marking the bridges of an undirected graph, marking the articulation points of such a graph, finding the length of a shortest cycle, finding a minimum spanning tree, and a number of other problems.