- #1

secondprime

- 49

- 0

https://www.physicsforums.com/threads/complexity-analysis-problem-of-an-algorithm.812931/

I would like to write a formal psudoecode (latex), but as new writer I am having hard time to write, whatever I wrote is not easy to understand, so i would appreciate forum members help. Steps are-

1. Divide the matrix of graph G according to above link's descrption.

2. Divide the matrix of graph H, for all possible combinations according to above link's descrption.

3. Check all combinations of H with the defined(found in step 1) G's matrix.

** consider the E matrix as matrix which has distinguishable tuple/row.

A presentation is-

https://www.academia.edu/11354697/Graph_regular_Isomorphism_in_n_O_log2_n_