2 citations · 2 across the 7 of their papers we have counts for
1 paper · 1 filter
Samuel Beasley, Ashley Montanaro
The graph isomorphism problem asks whether two graphs are equivalent up to a permutation of their vertices. Its precise computational complexity remains unresolved, and it is still…