Computational complexity of computing a partial solution for the Graph Automorphism problems

Takayuki Nagoya, Seinosuke Toda. Computational complexity of computing a partial solution for the Graph Automorphism problems. Theoretical Computer Science, 410(21-23):2064-2071, 2009. [doi]

Abstract

Abstract is missing.