Dismiss Notice
Join Physics Forums Today!
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:
  1. Mar 10, 2015 #1
    I am trying to construct an algorithm which is combinatorial in nature. I have shared a link-

    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!!
     
    Last edited by a moderator: May 7, 2017
  2. jcsd
  3. Mar 15, 2015 #2
    Thanks for the post! This is an automated courtesy bump. Sorry you aren't generating responses at the moment. Do you have any further information, come to any new conclusions or is it possible to reword the post?
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Graph (regular) Isomorphism in n^(O(log2(n))) .
  1. Proof for n (Replies: 5)

  2. Isomorphisms of graphs (Replies: 3)

Loading...