Graph Isomorphism

[1]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[2]  John E. Hopcroft,et al.  Polynomial-time algorithms for permutation groups , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[3]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[4]  Mike D. Atkinson,et al.  An algorithm for finding the blocks of a permutation group , 1975 .

[5]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[6]  A. Selman,et al.  Computability and Complexity Theory , 2001, Texts in Computer Science.

[7]  Á. Seress.  An Introduction to Computational Group Theory , 1997 .