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 language | English (US) |
---|---|
Pages (from-to) | 323-331 |
Number of pages | 9 |
Journal | Journal of Computer and System Sciences |
Volume | 7 |
Issue number | 3 |
DOIs | |
State | Published - Jun 1973 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science
- Applied Mathematics
- Computer Networks and Communications
- Computational Theory and Mathematics