A V log V algorithm for isomorphism of triconnected planar graphs

J. E. Hopcroft, R. E. Tarjan

Research output: Contribution to journalArticle

54 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)323-331
Number of pages9
JournalJournal of Computer and System Sciences
Volume7
Issue number3
DOIs
StatePublished - Jun 1973
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A V log V algorithm for isomorphism of triconnected planar graphs'. Together they form a unique fingerprint.

  • Cite this