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

A V log V algorithm for isomorphism of triconnected planar graphs

โœ Scribed by J.E. Hopcroft; R.E. Tarjan

Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
476 KB
Volume
7
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ 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

Acyclic list 7-coloring of planar graphs
Acyclic list 7-coloring of planar graphs
โœ O. V. Borodin; D. G. Fon-Der Flaass; A. V. Kostochka; A. Raspaud; E. Sopena ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 83 KB ๐Ÿ‘ 1 views

## Abstract The acyclic list chromatic number of every planar graph is proved to be at most 7. ยฉ 2002 Wiley Periodicals, Inc. J Graph Theory 40: 83โ€“90, 2002