Improved graph computations on the reconfigurable mesh

The paper develops a data structure and data movement operations which lead to efficient parallel graph computations on the reconfigurable mesh. The technique computes a minimal spanning forest of a N^1/2 vertex graph in O(log N log log N) time given the adjacency matrix of the graph on a N ^1/2×N^1/2 reconfigurable mesh. This improves over the known algorithms of O(log² N) time. The parallel technique can be modified to result in efficient parallel solutions to other graph problems such as checking whether the graph is biconnected, computing the articulation points and the cyclic index of the graph