Practical graph isomorphism, II

Journal of Symbolic Computation

Volumn 60, Issue , 2014, Pages 94-112

  McKay, Brendan D ^a   Piperno, Adolfo ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Canonical labelling; Graph isomorphism; Nauty; Partition refinement; Traces

Indexed keywords

EID: 84888202264     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2013.09.003     Document Type: Article

References (36)

1. Aho A.V., Hopcroft J.E., Ullman J.D. The Design and Analysis of Computer Algorithms 1974, 86. Addison-Wesley, Reading.
2. Arlazarov V.L., Zuev I.I., Uskov A.V., Faradzev I.A. An algorithm for the reduction of finite non-oriented graphs to canonical form. Ž. Vyčisl. Mat. Mat. Fiz. 1974, 14:737-743.
3. Babai L., Kantor W.M., Luks E.M. Computational complexity and the classification of finite simple groups. Proceedings of the 24th Annual Symposium on the Foundations of Computer Science 1983, 162-171.
4. Bodlaender H. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J. Algorithms 1990, 11:631-643.
5. Butler G., Lam C.W.H. A general backtrack algorithm for the isomorphism problem of combinatorial objects. J. Symb. Comput. 1985, 1:363-381.
6. Colbourn C.S., Booth K.S. Linear time automorphism algorithms for trees, interval graphs, and planar graphs. SIAM J. Comput. 1981, 10:203-225.
7. Corneil D.G., Gotlieb C.C. An efficient algorithm for graph isomorphism. J. ACM 1970, 17:51-64.
8. Darga P.T., Liffiton M.H., Sakallah K.A., Markov I.L. Exploiting structure in symmetry detection for CNF. Proceedings of the 41st Design Automation Conference 2004, 530-534.
9. Darga P.T., Sakallah K.A., Markov I.L. Faster symmetry discovery using sparsity of symmetries. Proceedings of the 45th Design Automation Conference 2008, 149-154.
10. Filotti I.S., Mayer J.N. A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. Proceedings of the 12th ACM Symposium on Theory of Computing 1980, 236-243.
11. Foggia P., Sansone C., Vento M. A performance comparison of five algorithms for graph isomorphism. Proceedings of the 3rd IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition 2001, 188-199.
12. Goldreich O., Micali S., Wigderson A. Proofs that yield nothing but their validity, or all languages in NP have zero-knowledge proof systems. J. ACM 1991, 38:690-728.
13. Grohe M. Fixed-point definability and polynomial time on graphs with excluded minors. Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science 2010, 179-188.
14. Grohe M. Structural and logical approaches to the graph isomorphism problem. Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms 2012, 188.
15. Junttila T., Kaski P. Engineering an efficient canonical labeling tool for large and sparse graphs. Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics 2007, 135-149.
16. Junttila T., Kaski P. Conflict propagation and component recursion for canonical labeling. Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms 2011, 151-162.
17. Kawarabayashi K., Mohar B. Graph and map isomorphism and all polyhedral embeddings in linear time. Proceedings of the 40th Annual ACM symposium on Theory of Computing 2008, 471-480.
18. Kirk A. Efficiency considerations in the canonical labelling of graphs 1985, Technical report TR-CS-85-05, Computer Science Department, Australian National University.
19. Kocay W. On writing isomorphism programs. Computational and Constructive Design Theory 1996, 135-175. Kluwer. W.D. Wallis (Ed.).
20. Leon J.S. Permutation group algorithms based on partitions, I: Theory and algorithms. J. Symb. Comput. 1990, 43:545-581.
21. López-Presa J.L., Fernández Anta A. Fast algorithm for graph isomorphism testing. Proceedings of the 8th International Symposium on Experimental Algorithms 2009, 221-232.
22. López-Presa J.L., Fernández Anta A., Núñez Chiroque L. Conauto-2.0: Fast isomorphism testing and automorphism group computation Preprint. Available at. http://arxiv.org/abs/1108.1060.
23. Luks E. Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 1982, 25:42-65.
24. McKay B.D. Backtrack programming and isomorph rejection on ordered subsets. Ars Comb. 1978, 5:65-99.
25. McKay B.D. Computing automorphisms and canonical labellings of graphs. Lect. Notes Math. 1978, vol. 686:223-232. Springer-Verlag, Berlin.
26. McKay B.D. Practical graph isomorphism. Congr. Numer. 1980, 30:45-87.
27. McKay B.D., Piperno A. nautyTraces, Software distribution web page and. http://pallini.di.uniroma1.it/.
28. McKay B.D., Piperno A. nauty and Traces User's Guide (Version 2.5) 2012, Available at McKay and Piperno (2012a).
29. Miller G.L. Isomorphism testing for graphs of bounded genus. Proceedings of the 12th ACM Symposium on Theory of Computing 1980, 225-235.
30. Myrvold W., Kocay W. Errors in graph embedding algorithms. J. Comput. Syst. Sci. 2011, 77:430-438.
31. Parris R., Read R.C. A coding procedure for graphs 1969, Scientific Report. UWI/CC 10, Univ. of West Indies Computer Centre.
32. Piperno A. Search space contraction in canonical labeling of graphs Preprint 2008-2011. Available at. http://arxiv.org/abs/0804.4881.
33. Ponomarenko I.N. The isomorphism problem for classes of graphs that are invariant with respec to contraction. Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 1988, 174(3):147-177. (in Russian).
34. Read R.C., Corneil D.G. The graph isomorphism disease. J. Graph Theory 1977, 1:339-363.
35. Seress Á. Permutation Group Algorithms 2003, Cambridge University Press, Cambridge, x+264 pp.
36. Stoichev S.D. Polynomial time and space exact and heuristic algorithms for determining the generators, orbits and order of the graph automorphism group Preprint. Available at. http://arxiv.org/abs/1007.1726.