Vsep-New Heuristic and Exact Algorithms for Graph Automorphism Group Computation

Understand

One exact and two heuristic algorithms for determining the generators, orbits and order of the graph automorphism group are presented.

• A basic tool of these algorithms is the well-known individualization and refinement procedure.
• A search tree is used in the algorithms - each node of the tree is a partition.
• All nonequivalent discreet partitions derivative of the selected vertices are stored in a coded form.