Return to Question

In short, I found an algorithm for GI and the only hard instances I found so far are non-isomorphic strongly regular graphs with large automorphism groups.

Q1 What are hard instances for the alogrithm?

The sage math code and the preprint

and the code in a browser on sagemath.org

Some success stories:

The Paley graph of order $73$ was solved in $9$ recursive calls (each polynomial) and time 703 ms.

The strongly regular graph with parameters $(100, 44, 18, 20)$ was solved in $12$ calls and time 1.5 sec.

Related to Permutation similarity of matrices with many distinct entries

In short, I found an algorithm for GI and the only hard instances I found so far are non-isomorphic strongly regular graphs with large automorphism groups.

Q1 What are hard instances for the alogrithm?

The sage math code and the preprint

and the code in a browser on sagemath.org

Some success stories:

The Paley graph of order $73$ was solved in $9$ recursive calls (each polynomial) and time 703 ms.

The strongly regular graph with parameters $(100, 44, 18, 20)$ was solved in $12$ calls and time 1.5 sec.

Related to Permutation similarity of matrices with many distinct entries

For random regular graphs the algorithm is $O(\log_2(n)n^4)$.

In short, I found an algorithm for GI and the only hard instances I found so far are non-isomorphic strongly regular graphs with large automorphism groups.

Q1 What are hard instances for the alogrithm?

The sage math code and the preprint

and the code in a browser on sagemath.org

Some success stories:

The Paley graph of order $73$ was solved in $9$ recursive calls (each polynomial) and time 703 ms.

The strongly regular graph with parameters $(100, 44, 18, 20)$ was solved in $12$ calls and time 1.5 sec.

In short, I found an algorithm for GI and the only hard instances I found so far are non-isomorphic strongly regular graphs with large automorphism groups.

Q1 What are hard instances for the alogrithm?

The sage math code and the preprint

and the code in a browser on sagemath.org

Some success stories:

The Paley graph of order $73$ was solved in $9$ recursive calls (each polynomial) and time 703 ms.

The strongly regular graph with parameters $(100, 44, 18, 20)$ was solved in $12$ calls and time 1.5 sec.

Related to Permutation similarity of matrices with many distinct entries

In short, I found an algorithm for GI and the only hard instances I found so far are non-isomorphic strongly regular graphs with large automorphism groups.

Q1 What are hard instances for the alogrithm?

The sage math code and the preprint

and the code in a browser on sagemath.org

Some success stories:

The Paley graph of order $73$ was solved in $9$ recursive calls (each polynomial) and time 703 ms.

The strongly regular graph with parameters $(100, 44, 18, 20)$ was solved in $12$ calls.

In short, I found an algorithm for GI and the only hard instances I found so far are non-isomorphic strongly regular graphs with large automorphism groups.

Q1 What are hard instances for the alogrithm?

The sage math code and the preprint

and the code in a browser on sagemath.org

Some success stories:

The Paley graph of order $73$ was solved in $9$ recursive calls (each polynomial) and time 703 ms.

The strongly regular graph with parameters $(100, 44, 18, 20)$ was solved in $12$ calls and time 1.5 sec.