I am trying to construct an algorithm which is combinatorial in nature. I have shared a link-(adsbygoogle = window.adsbygoogle || []).push({});

https://www.academia.edu/11354697/Graph_regular_Isomorphism_in_n_O_log2_n_ [Broken]

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

happy to have comments!!

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

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

Tags:

**Physics Forums | Science Articles, Homework Help, Discussion**