Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 934637, 15 pages
http://dx.doi.org/10.1155/2014/934637
Research Article

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

1DIATEL-UPM, 28031 Madrid, Spain
2IMDEA Networks Institute, 28918 Madrid, Spain

Received 3 April 2014; Accepted 24 June 2014; Published 24 July 2014

Academic Editor: Renat Zhdanov

Copyright © 2014 José Luis López-Presa et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. L. Faulon, “Isomorphism, automorphism partitioning, and canonical labeling can be solved in polynomial-time for molecular graphs,” Journal of Chemical Information and Computer Sciences, vol. 38, no. 3, pp. 432–444, 1998. View at Google Scholar · View at Scopus
  2. G. Tinhofer and M. Klin, “Algebraic combinatorics in mathematical chemistry. Methods and algorithms III. Graph invariants and stabilization methods,” Tech. Rep. TUM -M9902, Technische Universitat Munchen, 1999. View at Google Scholar
  3. D. Conte, P. Foggia, C. Sansone, and M. Vento, “Graph matching applications in pattern recognition and image processing,” in Proceedings of the 2003 International Conference on Image Processing (ICIP '03), vol. 2, pp. 21–24, IEEE Computer Society Press, Barcelona, Spain, September 2003. View at Scopus
  4. B. D. McKay, “Practical graph isomorphism,” Congressus Numerantium, vol. 30, pp. 45–87, 1981. View at Google Scholar
  5. B. D. McKay, The Nauty Page, Computer Science Department, Austra lian National University, 2010, http://cs.anu.edu.au/~bdm/nauty/.
  6. T. A. Junttila and P. Kaski, “Engineering an efficient canonical labeling tool for large and sparse graphs,” in Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX '07), pp. 135–149, January 2007. View at Scopus
  7. T. Junttila and P. Kaski, “Conflict propagation and component recursion for canonical labeling,” in Theory and Practice of Algorithms in (Computer) Systems, vol. 6595 of Lecture Notes in Computer Science, pp. 151–162, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar
  8. A. Piperno, “Search space contraction in canonical labeling of graphs (preliminary version),” CoRR, http://arxiv.org/abs/0804.4881.
  9. G. Tener and N. Deo, “Attacks on hard instances of graph isomorphism,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 64, pp. 203–226, 2008. View at Google Scholar · View at MathSciNet · View at Scopus
  10. G. Tener, Attacks on difficult instances of graph isomorphism: sequential and parallel algorithms [Ph.D. thesis], University of Central Florida, 2009.
  11. B. D. McKay and A. Piperno, “Practical graph isomorphism, II,” Journal of Symbolic Computation, vol. 60, pp. 94–112, 2014. View at Publisher · View at Google Scholar
  12. P. T. Darga, M. H. Liffiton, K. A. Sakallah, and I. L. Markov, “Exploiting structure in symmetry detection for CNF,” in Proceedings of the 41st Design Automation Conference, pp. 530–534, ACM, June 2004. View at Scopus
  13. H. Katebi, K. A. Sakallah, and I. L. Markov, “Symmetry and satisfiability: an update,” in SAT, vol. 6175 of Lecture Notes in Computer Science, pp. 113–127, Springer, 2010. View at Google Scholar
  14. H. Katebi, K. A. Sakallah, and I. L. Markov, “Conflict anticipation in the search for graph automorphisms,” in Logic for Programming, Artificial Intelligence, and Reasoning, N. Bjorner and A. Voronkov, Eds., vol. 7180 of Lecture Notes in Computer Science, pp. 243–257, Springer, Heidelberg, Germany, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. P. Codenotti, H. Katebi, K. A. Sakallah, and I. L. Markov, “Conict analysis and branching heuristics in the search for graph automorphisms,” in Proceedings of the IEEE 25th International Conference on Tools with Artificial Intelligence (ICTAI '13), pp. 907–914, November 2013.
  16. H. Katebi, A. K. Sakallah, and L. I. Markov, “Graph symmetry detection and canonical labeling: differences and synergies,” in Turing-100, volume 10 of EPiC Series, A. Voronkov, Ed., vol. 10 of EPiC Series, pp. 181–195, EasyChair, Manchester, UK, 2012. View at Google Scholar
  17. B. Weisfeiler, On Construction and Identification of Graphs, vol. 558 of Lecture Notes in Mathematics, Springer, Berlin, Germany, 1976. View at MathSciNet
  18. T. Miyazaki, “The complexity of McKay's canonical labeling algorithm,” in Groups and Computation II, vol. 28, pp. 239–256, American Mathematical Society, 1997. View at Google Scholar · View at MathSciNet
  19. J. L. Lopez-Presa and A. F. Anta, “Fast algorithm for graph isomorphism testing,” in Experimental Algorithms, vol. 5526 of Lecture Notes in Computer Science, pp. 221–232, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar
  20. J. L. López-Presa, Efficient algorithms for graph isomorphism testing [Ph.D. thesis], La Escuela Técnica Superior de Ingeniería de Telecomunicación, Universidad Rey Juan Carlos, Madrid, Spain, 2009, http://www.diatel.upm.es/jllopez/tesis/thesis.pdf.
  21. T. Czajka and G. Pandurangan, “Improved random graph isomorphism,” Journal of Discrete Algorithms, vol. 6, no. 1, pp. 85–92, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  22. J. L. Lopez-Presa, Benchmark Graphs for Evaluating Graph Isomorphism Algorithms, Conauto Website by Google sites, 2011, http://sites.google.com/site/giconauto/home/benchmarks.
  23. T. Junttila, Benchmark Graphs for Evaluating Graph Automorphism and Canonical Labeling Algorithms, Laboratory for Theoretical Computer Science, Helsinki University of Technology, 2009, http://www.tcs.hut.fi/Software/bliss/benchmarks/index.shtml.
  24. G. E. Moorhouse, “Projective planes of small order,” Department of Mathematics, University of Wyoming, 2005, http://www.uwyo.edu/moorhouse/pub/planes/.
  25. M. de Santo, P. Foggia, C. Sansone, and M. Vento, “A large database of graphs and its use for benchmarking graph isomorphism algorithms,” Pattern Recognition Letters, vol. 24, no. 8, pp. 1067–1079, 2003. View at Publisher · View at Google Scholar · View at Scopus