๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel algorithms for planar graph isomorphism and related problems

โœ Scribed by Jaja, J.; Kosaraju, S.R.


Book ID
114559640
Publisher
IEEE
Year
1988
Weight
833 KB
Volume
35
Category
Article
ISSN
0098-4094

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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