Graph (regular) Isomorphism in n^(O(log2(n))) .

Tags:
1. Mar 10, 2015

secondprime

I am trying to construct an algorithm which is combinatorial in nature. I have shared a link-

which depicts the idea simply using an example. I claim (if it is correct) n^(O(log2(n))) time complexity.