Computing Symmetries of Combinatorial Objects (Abstract)
McKay, Brendan D. (2008) Computing Symmetries of Combinatorial Objects (Abstract). In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , p. 1 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_1).
Full text not available from this repository.
We survey the practical aspects of computing the symmetries (automorphism) 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.
Repository Staff Only: item control page