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

A (sub)graph isomorphism algorithm for matching large graphs

โœ Scribed by Cordella, L.P.; Foggia, P.; Sansone, C.; Vento, M.

Book ID
117931154
Publisher
IEEE
Year
2004
Tongue
English
Weight
549 KB
Volume
26
Category
Article
ISSN
0162-8828

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Randomized Parallel Algorithm for Plan
A Randomized Parallel Algorithm for Planar Graph Isomorphism
โœ 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