Hi, I was wondering if the automorphism decision algorithm in NAUTY is polynomial time or not. I am under the impression that finding automorphisms has not been shown to be able to be done in polynomial time, but I do not know about the decision version. Grant Farmer