A parallel algorithm for recognizing unordered depth-first search (Q1111396)

We present a parallel algorithm for the concurrent-read, exclusive-write PRAM model that determines in \(O(\log^ 2 V)\) time using M(V) processors whether a given directed spanning forest of a given graph corresponds to some unordered depth-first search, where \(M(V)=O(V^{2.376})\) is the number of processors needed to do transitive closure in \(O(\log^ 2 V)\) time. If the answer is ``yes'', the depth-first numbering of the vertices is also output. The algorithm can be modified to avoid concurrent reading at the expense of more processors.