𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast backtrack algorithm for graph isomorphism

✍ Scribed by Hari Ballabh Mittal


Book ID
113163176
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
492 KB
Volume
29
Category
Article
ISSN
0020-0190

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