Journal of Applied Mathematics

Novel Techniques to Speed Up the Computation of the Automorphism Group of a Graph

José Luis López-Presa, Luis F. Chiroque, and Antonio Fernández Anta

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

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.

Article information

Source
J. Appl. Math., Volume 2014 (2014), Article ID 934637, 15 pages.

Dates
First available in Project Euclid: 2 March 2015

Permanent link to this document
https://projecteuclid.org/euclid.jam/1425305934

Digital Object Identifier
doi:10.1155/2014/934637

Mathematical Reviews number (MathSciNet)
MR3246439

Citation

López-Presa, José Luis; Chiroque, Luis F.; Fernández Anta, Antonio. Novel Techniques to Speed Up the Computation of the Automorphism Group of a Graph. J. Appl. Math. 2014 (2014), Article ID 934637, 15 pages. doi:10.1155/2014/934637. https://projecteuclid.org/euclid.jam/1425305934


Export citation