Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version)

Abstract We present 0(log 2 n) step parallel algorithms for planarity testing and for finding the triply connected components of a graph. The algorithms use a polynomial number of synchronous processors with shared memory.

Authors

• Joseph F. JáJá
• Janos Simon

Keywords

No keywords are indexed for this paper.