Fast Parallel Processing Array Algorithms for some Graph Problems (Preliminary Version)

The parallel processing array consists of an n×n array of processors to which a cn 2 node directed graph can be input by placing c nodes at every point of the array. It is shown that every one of the following properties of the graph can be computed in order of n steps:

Authors

• S. Rao Kosaraju

Keywords

No keywords are indexed for this paper.