Tree Open Ear Decomposition in Parallel Graph Algorithms

Tree open ear decomposition has been proposed as a potentially useful technique in parallel graph algorithms. We present an efficient parallel algorithm implementing depth-first search in a graph, ...