A V log V algorithm for isomorphism of triconnected planar graphs

Authors:
J. E. Hopcroft;R. E. Tarjan
Affiliations:
-;-
Venue:
Journal of Computer and System Sciences
Year:
1973

Citing 1
Cited 4

An Efficient Algorithm for Graph Isomorphism

Journal of the ACM (JACM)

Finding Planar Geometric Automorphisms in Planar Graphs

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A General Method for Graph Isomorphism

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
The Graph Isomorphism Problem and approximate categories

Journal of Symbolic Computation
Faster reaction mapping through improved naming techniques

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.