Advertisement

Isomorphism of Planar Graphs (Working Paper)

  • J. E. Hopcroft
  • R. E. Tarjan
Part of the The IBM Research Symposia Series book series (IRSS)

Abstract

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.

Keywords

Span 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Plenum Press, New York 1972

Authors and Affiliations

  • J. E. Hopcroft
    • 1
  • R. E. Tarjan
    • 1
  1. 1.Cornell UniversityIthacaUSA

Personalised recommendations