Computing Symmetries of Combinatorial Objects

(Abstract)
  • Brendan D. McKay
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4875)

Abstract

We survey the practical aspects of computing the symmetries (automorphisms) of combinatorial objects. These include all manner of graphs with adornments, matrices, point sets, etc.. Since automorphisms are just isomorphisms from an object to itself, the problem is intimately related to that of finding isomorphisms between two objects.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Brendan D. McKay
    • 1
  1. 1.Department of Computer ScienceAustralian National University 

Personalised recommendations