Fast parallel processing array algorithms for some graph problems(Preliminary Version)
S. Rao Kosaraju · 1979
The parallel processing array consists of an n×n array of processors to which a cn2 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: