1 citations · 1 across the 4 of their papers we have counts for
1 paper · 1 filter
Aleksandr Golubchik
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algo…