A Randomized Parallel Algorithm for Plan
โ
Hillel Gazit; John H Reif
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 223 KB
We present a parallel randomized algorithm running on a CRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph ลฝ ลฝ 2 . 1 q โ which can be computed by known algorithms in O log n time with