A linear-processor algorithm for depth-first search in planar graphs

Gregory E. Shannon
1988 Information Processing Letters  
We present an n-processor and O(lo~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 original parallel depth-first-search algorithm for planar graphs [Smi86].
doi:10.1016/0020-0190(88)90048-8 fatcat:eluthznvlrhgfkcwi3mkynbpdy