Abstract
Graph automorphism (GA) is a classical problem, in which the objective is to compute the automorphism group of an input graph. In this work we propose four novel techniques to speed up algorithms that solve the GA problem by exploring a search tree. They increase the performance of the algorithm by allowing to reduce 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 the input graph. We also describe how the 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.
We have experimentally evaluated the impact of each of the above techniques with several graph families. We have observed that each of the techniques by itself significantly reduces the number of processed nodes of the search tree in some subset of graphs, which justifies the use of each of them. Then, when they are applied together, their effect is combined, leading to reductions in the number of processed nodes in most graphs. This is also reflected in a reduction of the running time, which is substantial in some graph families.
Research was supported in part by the Comunidad de Madrid grant S2009TIC-1692, Spanish MINECO/MICINN grant TEC2011-29688-C02-01, Factory Holding Company 25, S.L., grant SOCAM, and National Natural Science Foundation of China grant 61020106002.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Conte, D., Foggia, P., Sansone, C., Vento, M.: Graph matching applications in pattern recognition and image processing. In: ICIP, Barcelona, Spain, vol. 2, pp. 21–24 (September 2003)
Czajka, T., Pandurangan, G.: Improved random graph isomorphism. Journal of Discrete Algorithms 6(1), 85–92 (2008)
Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting structure in symmetry detection for cnf. In: DAC, pp. 530–534 (2004)
Faulon, J.-L.: Isomorphism, automorphism partitioning, and canonical labeling can be solved in polynomial–time for molecular graphs. Journal of Chemical Information and Computer Science 38, 432–444 (1998)
Junttila, T., Kaski, P.: Conflict propagation and component recursion for canonical labeling. In: Marchetti-Spaccamela, A., Segal, M. (eds.) TAPAS 2011. LNCS, vol. 6595, pp. 151–162. Springer, Heidelberg (2011)
Junttila, T.A., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: ALENEX (2007)
Katebi, H., Sakallah, K.A., Markov, I.L.: Symmetry and satisfiability: An update. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 113–127. Springer, Heidelberg (2010)
Katebi, H., Sakallah, K.A., Markov, I.L.: Conflict anticipation in the search for graph automorphisms. In: Bjørner, N., Voronkov, A. (eds.) LPAR-18. LNCS, vol. 7180, pp. 243–257. Springer, Heidelberg (2012)
Katebi, H., Sakallah, K.A., Markov, I.L.: Graph symmetry detection and canonical labeling: Differences and synergies. In: Turing-100. EPiC Series, vol. 10, pp. 181–195 (2012)
Presa, J.L.L.: Efficient Algorithms for Graph Isomorphism Testing. PhD thesis, ETSIT, Universidad Rey Juan Carlos, Madrid, Spain (March 2009)
López-Presa, J.L., Chiroque, L.N., Anta, A.F.: Benchmark graphs for evaluating graph isomorphism algorithms. Conauto website by Google sites (2011), http://sites.google.com/site/giconauto/home/benchmarks
López-Presa, J.L., Fernández Anta, A.: Fast algorithm for graph isomorphism testing. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 221–232. Springer, Heidelberg (2009)
McKay, B.D.: Practical graph isomorphism. Congressus Numerantium 30, 45–87 (1981)
McKay, B.D.: The nauty page. Computer Science Department, Australian National University (2010), http://cs.anu.edu.au/~bdm/nauty/
McKay, B.D., Piperno, A.: Practical graph isomorphism, ii (2013)
Miyazaki, T.: The complexity of McKay’s canonical labeling algorithm. In: Groups and Computation II, pp. 239–256. American Mathematical Society (1997)
Piperno, A.: Search space contraction in canonical labeling of graphs (preliminary version). CoRR, abs/0804.4881 (2008)
Tener, G.: Attacks on difficult instances of graph isomorphism: sequential and parallel algorithms. Phd thesis, University of Central Florida (2009)
Tener, G., Deo, N.: Attacks on hard instances of graph isomorphism. Journal of Combinatorial Mathematics and Combinatorial Computing 64, 203–226 (2008)
Tinhofer, G., Klin, M.: Algebraic combinatorics in mathematical chemistry. Methods and algorithms III. Graph invariants and stabilization methods. Technical Report TUM-M9902, Technische Universität München (March 1999)
Weisfeiler, B. (ed.): On construction and identification of graphs. Lecture Notes in Mathematics, vol. 558 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López-Presa, J.L., Chiroque, L.N., Fernández Anta, A. (2013). Novel Techniques for Automorphism Group Computation. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds) Experimental Algorithms. SEA 2013. Lecture Notes in Computer Science, vol 7933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38527-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-38527-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38526-1
Online ISBN: 978-3-642-38527-8
eBook Packages: Computer ScienceComputer Science (R0)