Polynomial time and space exact and heuristic algorithms for determining the generators, orbits and order of the graph automorphism group

Two new polynomial time and space algorithms, exact (VSEPARN) and heuristic (HEURAUT) for determining the generators, orbits and order of an undirected graph automorphism group are presented. A basic tool of these algorithms is the adjacency refinement procedure that gives finer output partition on a given input partition of graph vertices. The refinement… CONTINUE READING