Practical graph isomorphism, II

Aho, 1974, 86

Arlazarov, 1974, An algorithm for the reduction of finite non-oriented graphs to canonical form, Ž. Vyčisl. Mat. Mat. Fiz., 14, 737

Babai, 1983, Computational complexity and the classification of finite simple groups, 162

Bodlaender, 1990, Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees, J. Algorithms, 11, 631, 10.1016/0196-6774(90)90013-5

Butler, 1985, A general backtrack algorithm for the isomorphism problem of combinatorial objects, J. Symb. Comput., 1, 363, 10.1016/S0747-7171(85)80021-3

Colbourn, 1981, Linear time automorphism algorithms for trees, interval graphs, and planar graphs, SIAM J. Comput., 10, 203, 10.1137/0210015

Corneil, 1970, An efficient algorithm for graph isomorphism, J. ACM, 17, 51, 10.1145/321556.321562

Darga, 2004, Exploiting structure in symmetry detection for CNF, 530

Darga, 2008, Faster symmetry discovery using sparsity of symmetries, 149

Filotti, 1980, A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus, 236

Foggia, 2001, A performance comparison of five algorithms for graph isomorphism, 188

Goldreich, 1991, Proofs that yield nothing but their validity, or all languages in NP have zero-knowledge proof systems, J. ACM, 38, 690, 10.1145/116825.116852

Grohe, 2010, Fixed-point definability and polynomial time on graphs with excluded minors, 179

Grohe, 2012, Structural and logical approaches to the graph isomorphism problem, 188

Junttila, 2007, Engineering an efficient canonical labeling tool for large and sparse graphs, 135

Junttila, 2011, Conflict propagation and component recursion for canonical labeling, 151

Kawarabayashi, 2008, Graph and map isomorphism and all polyhedral embeddings in linear time, 471

Kirk, 1985

Kocay, 1996, On writing isomorphism programs, 135

Leon, 1990, Permutation group algorithms based on partitions, I: Theory and algorithms, J. Symb. Comput., 43, 545

López-Presa, 2009, Fast algorithm for graph isomorphism testing, 221

López-Presa

Luks, 1982, Isomorphism of graphs of bounded valence can be tested in polynomial time, J. Comput. Syst. Sci., 25, 42, 10.1016/0022-0000(82)90009-5

McKay, 1978, Backtrack programming and isomorph rejection on ordered subsets, Ars Comb., 5, 65

McKay, 1978, Computing automorphisms and canonical labellings of graphs, vol. 686, 223

McKay, 1980, Practical graph isomorphism, Congr. Numer., 30, 45

McKay

McKay, 2012

Miller, 1980, Isomorphism testing for graphs of bounded genus, 225

Myrvold, 2011, Errors in graph embedding algorithms, J. Comput. Syst. Sci., 77, 430, 10.1016/j.jcss.2010.06.002

Parris, 1969

Piperno

Ponomarenko, 1988, The isomorphism problem for classes of graphs that are invariant with respec to contraction, Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI), 174, 147

Read, 1977, The graph isomorphism disease, J. Graph Theory, 1, 339, 10.1002/jgt.3190010410

Seress, 2003

Stoichev