Graph isomorphism problem and \(2\)-closed permutation groups (Q1311608)

The purpose of the paper is twofold. First, the author gives a polynomial time algorithm for finding a strong generating set of the 2-closure of a nilpotent permutation group. (He notices that this 2-closure is solvable. One can see that it is even nilpotent.) Second, the author proves that for 2-closed permutation groups several notoriously hard algorithmic problems are actually polynomially equivalent to the graph isomorphism problem, in particular finding intersections, setwise stabilizers, normalizers and testing conjugacy. Three equivalent problems for coherent configurations are also mentioned. \{There is a misprint in the crucial definition of \(\overline{g}_ i\) on p. 17, and even if this is corrected the proof can work only for undirected graphs\}.