> < ^ Date: Fri, 20 Oct 2000 16:15:43 +1100 (EST)
< ^ From: David Wood <davidw@cs.usyd.edu.au >
^ Subject: fast symmetry checking

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,

This paper is mainly concerned with finding symmetries in planar graphs,
but the idea still works for non-planar graphs. Also see

  Basser Department of Computer Science 
  The University of Sydney

Miles-Receive-Header: reply

> < [top]