Takayuki Nagoya Seinosuke Toda Computational complexity of computing a partial solution for the Graph Automorphism problems. 2064-2071 2009 410 Theor. Comput. Sci. 21-23 http://dx.doi.org/10.1016/j.tcs.2009.01.001 db/journals/tcs/tcs410.html#NagoyaT09