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

A V2 algorithm for determining isomorphism of planar graphs

โœ Scribed by John Hopcroft; Robert Tarjan

Book ID
113161663
Publisher
Elsevier Science
Year
1971
Tongue
English
Weight
512 KB
Volume
1
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A V log V algorithm for isomorphism of t
A V log V algorithm for isomorphism of triconnected planar graphs
โœ J.E. Hopcroft; R.E. Tarjan ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 476 KB

An algorithm for determining whether two triconnected planar graphs are isomorphic is presented. The asymptotic growth rate of the algorithm is bounded by a constant times ! V ! log I V [ where I V I is the number of vertices in the graphs.

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