Parallel strong orientation on a mesh connected computer

The author presents a solution for the following problem: given an undirected bridgeless graph G=(V, E), find an orientation of each edge such that the resulting directed graph is strongly connected. He assumes the input graph to be given as an adjacency matrix stored in the processors of a mesh connected processor array such that each processor contains one entry. The algorithm is a modification off R.E. Tarjan and U. Vishkin´s strong orientation method (1985) for a CREW PRAM. It takes time O(n) for an n-vertex graph which is asymptotically optimal for the considered computer model