Part of the The IBM Research Symposia Series book series (IRSS)
Isomorphism of Planar Graphs (Working Paper)
An algorithm is presented for determining whether or not two planar graphs are isomorphic. The algorithm requires O(V log V) time, if V is the number of vertices in each graph.
KeywordsSpan Tree Planar Graph Palm Tree Isomorphism Problem Isomorphic Graph
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Plenum Press, New York 1972