If you are interested in the fast (non-exact) detection of the symmetries
of a graph see:

H. de Fraysseix, "An Heuristic for Graph Symmetry Detection", Proc. Graph
Drawing '99, Lecture Notes in Computer Science, pages 276-285, Springer,
1999.

This paper is mainly concerned with finding symmetries in planar graphs,
but the idea still works for non-planar graphs. Also see
http://www.ehess.fr/centres/cams/person/hf/pigale.html.

--David-Wood-------------------------------------------------------
  Basser Department of Computer Science 
  The University of Sydney
--http://www.cs.usyd.edu.au/~davidw--------------------------------

Miles-Receive-Header: reply