A linear-processor algorithm for depth-first search in planar graphs (Q1110342): Difference between revisions

We present an n-processor and \(O(\log^ 2 n)\) time parallel RAM algorithm for finding a depth-first-search tree in an n-vertex planar graph. The algorithm is based on a new n-processor algorithm for finding a cyclic separator in a planar graph and Smith's [\textit{J. R. Smith}, SIAM J. Comput. 15, 814-830 (1986; Zbl 0612.68059)] original parallel depth- first-search algorithm for planar graphs.