Conflict Propagation and Component Recursion for Canonical Labeling

  • Tommi Junttila
  • Petteri Kaski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6595)

Abstract

The individualize and refine approach for computing automorphism groups and canonical forms of graphs is studied. Two new search space pruning techniques, conflict propagation based on recorded failure information and recursion over nonuniformly joined components, are presented. Experimental results show that the techniques can result in substantial decrease in both search space sizes and run times.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proc. STOC 1983, pp. 171–183. ACM, New York (1983)Google Scholar
  2. 2.
    Babai, L., Codenotti, P.: Isomorhism of hypergraphs of low rank in moderately exponential time. In: Proc. FOCS 2008, pp. 667–676. IEEE, Los Alamitos (2008)Google Scholar
  3. 3.
    Junttila, T., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: Proc. ALENEX 2007. SIAM, Philadelphia (2007)Google Scholar
  4. 4.
    McKay, B.D.: Practical graph isomorphism. Congressus Numerantium 30, 45–87 (1981)MathSciNetMATHGoogle Scholar
  5. 5.
    McKay, B.D.: Nauty user’s guide (version 2.4). Technical report, Department of Computer Science, Australian National University (2009)Google Scholar
  6. 6.
    Goldberg, M.K.: A nonfactorial algorithm for testing isomorphism of two graphs. Discrete Applied Mathematics 6, 229–236 (1983)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Darga, P.T., Sakallah, K.A., Markov, I.L.: Faster symmetry discovery using sparsity of symmetries. In: Proc. DAC 2008, pp. 149–154. ACM, New York (2008)Google Scholar
  8. 8.
    Piperno, A.: Search space contraction in canonical labeling of graphs (preliminary version). CoRR report abs/0804.4881, arXiv.org (2008), http://arxiv.org/abs/0804.4881

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Tommi Junttila
    • 1
  • Petteri Kaski
    • 1
  1. 1.Department of Information and Computer ScienceAalto University and Helsinki Institute for Information TechnologyAaltoFinland

Personalised recommendations