A V log V algorithm for isomorphism of triconnected planar graphs

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 | V| where | V| is the number of vertices in the graphs.

Saved in:
Bibliographic Details
Published inJournal of computer and system sciences Vol. 7; no. 3; pp. 323 - 331
Main Authors Hopcroft, J.E., Tarjan, R.E.
Format Journal Article
LanguageEnglish
Published Elsevier Inc 1973
Online AccessGet full text
ISSN0022-0000
1090-2724
DOI10.1016/S0022-0000(73)80013-3

Cover

More Information
Summary: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 | V| where | V| is the number of vertices in the graphs.
ISSN:0022-0000
1090-2724
DOI:10.1016/S0022-0000(73)80013-3