@InProceedings{ valiente:lncs:2138:2001,
author = {Gabriel Valiente},
booktitle = {Proc.\ 13th Int.\ Symposium on Fundamentals of Computation
Theory},
pages = {428--431},
publisher = {Springer-Verlag},
series = {Lecture Notes in Computer Science},
title = {A General Method for Graph Isomorphism},
volume = {2138},
year = {2001},
abstract = {A general method is presented for testing graph
isomorphism, which exploits those sufficient conditions
that define linear orderings on the vertices of the graphs.
The method yields simple and constructive, low-order
polynomial graph isomorphism algorithms for classes of
graphs which have a unique ordering, or a small (not
necessarily bounded) number of different orderings. The
general method is instantiated to several graph classes,
including: rooted trees, interval graphs, outerplanar
graphs, biconnected outerplanar graphs, and triconnected
planar graphs. Although more efficient algorithms are known
for isomorphism on some of these classes of graphs, the
method can be applied to any class of graphs having a
polynomial number of different orderings and an efficient
algorithm for enumerating all these orderings.}
}