BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-71-192
       ENTRY:: November 01, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: An n log n algorithm for isomorphism of planar triply
               connected graphs
        TYPE:: Technical Report
      AUTHOR:: Hopcroft, John E.
        DATE:: January 1971
       PAGES:: 10
    ABSTRACT:: It is shown that the isomorphism problem for triply connected
               planar graphs can be reduced to the problem of minimizing
               states in a finite automaton. By making use of an n log n
               algorithm for minimizing the number of states in a finite
               automaton, an algorithm for determining whether two planar
               triply connected graphs are isomorphic is developed. The
               asymptotic growth rate of the algorithm grows as n log n
               where n is the number of vertices in the graph.
       NOTES:: [Adminitrivia V1/Prg/19951101]
         END:: STAN//CS-TR-71-192