Open Access
Translator Disclaimer
2014 Novel Techniques to Speed Up the Computation of the Automorphism Group of a Graph
José Luis López-Presa, Luis F. Chiroque, Antonio Fernández Anta
J. Appl. Math. 2014: 1-15 (2014). DOI: 10.1155/2014/934637


Graph automorphism (GA) is a classical problem, in which the objective is to compute the automorphism group of an input graph. Most GA algorithms explore a search tree using the individualization-refinement procedure. Four novel techniques are proposed which increase the performance of any algorithm of this type by reducing the depth of the search tree and by effectively pruning it. We formally prove that a GA algorithm that uses these techniques correctly computes the automorphism group of an input graph. Then, we describe how these techniques have been incorporated into the GA algorithm conauto, as conauto-2.03, with at most an additive polynomial increase in its asymptotic time complexity. Using a benchmark of different graph families, we have evaluated the impact of these techniques on the size of the search tree, observing a significant reduction both when they are applied individually and when all of them are applied together. This is also reflected in a reduction of the running time, which is substantial for some graph families. Finally, we have compared the search tree size of conauto-2.03 against those of other popular GA algorithms, observing that, in most cases, conauto explores less nodes than these algorithms.


Download Citation

José Luis López-Presa. Luis F. Chiroque. Antonio Fernández Anta. "Novel Techniques to Speed Up the Computation of the Automorphism Group of a Graph." J. Appl. Math. 2014 1 - 15, 2014.


Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07131991
MathSciNet: MR3246439
Digital Object Identifier: 10.1155/2014/934637

Rights: Copyright © 2014 Hindawi


Vol.2014 • 2014
Back to Top