@article{066bf3547a484e2bb4ce3f3b7be4d70b,

title = "A V log V algorithm for isomorphism of triconnected planar graphs",

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.",

author = "Hopcroft, {J. E.} and Tarjan, {R. E.}",

note = "Funding Information: A graph G ~ (V, E) consists of a finite set of vertices V and a finite set of edges E. If the edges are unordered pairs (v, w) of vertices, the graph is undirected. If the edges are ordered pairs (v, w) of vertices, the graph is directed; v is called the tail * This research was supported by the National Science Foundation t, nder grant number NSF-GJ-96 and the Oi'fice of Naval Research under grant numbers N-00014-67-A-9112-0057 NR004-402 and N-00014-67-A-0077-0021 NR 044-417. Reproduction in whole or part is permitted for any purpose of the United States Government.",

year = "1973",

month = jun,

doi = "10.1016/S0022-0000(73)80013-3",

language = "English (US)",

volume = "7",

pages = "323--331",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

number = "3",

}