All Questions

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 ...

We found, implemented and tested algorithm for graph isomorphism and it appears to be polynomial time if the graph is rigid. Q1 Is the algorithm below correct and polynomial time for rigid graphs? A ...

I am seeking some reference on already existing work for the following problem. Given an $n$-dimensional square matrix $A=DP$ where $D$ is a diagonal and $P$ is a permutation matrix (think of Gaussian ...

Hi, I was reading this thread: Finding a cycle of fixed length I want to find a 5-cycle in a graph. Actually, what I really want is a shortest odd cycle of length at least 5, but maybe that is a ...

Hi, I have a (symmetric) matrix $M$ that represents the distance between each pair of nodes. For example, A B C D E F G H I J K L A 0 20 20 20 40 60 60 60 100 120 ...