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

Download PDF
Open Webpage

Joseph F. JáJá, Janos Simon

Published: 1980, Last Modified: 15 May 2025MFCS 1980EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We present 0(log2n) 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.