Graph Problems on a Mesh-Connected Processor Array
Mikhail J. Atallah, S. Rao Kosaraju · Journal of the ACM · 1984
Algorithms that run in O(n) steps are given for solving a number of graph problems on an n x n array of processors.The problems considered include: finding the bridges and artiedation points of an undirected graph, findmg the length of a shortest cycle, finding a minimum spanning tree, and a number of other problems.