For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Simple Canonical Code for Fullerene Graphs
Naoki SHIMOTSUMA Shin-ichi NAKANO
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/12/01
Online ISSN: 1745-1337
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Algorithms and Data Structures
Full Text: PDF>>
In this paper we give a simple algorithm to compute a canonical code for fullerene graphs. Our algorithm runs in O(n) time, while the best known algorithm runs in O(n2) time. Our algorithm is simple. One can generalize the algorithm to compute a canonical code for the skeleton of a convex polyhedron with n vertices. The algorithm runs in O(n2) time.