Skip to main content

All Questions

3 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
2 votes
0 answers
203 views

Permutation similarity of matrices with many distinct entries

This is related to graph isomorphism. Here matrices are square $n \times n$ with non-negative integer entries. Two matrices $A,B$ are permutation similar if there exist permutation matrix $P$ such ...
joro's user avatar
  • 25.4k
2 votes
0 answers
119 views

Complete graph invariant based on integer programming?

Roughly speaking, we are trying to find complete graph invariant as the lexicographically first matrix from the permutations of the adjacency matrix. Let $G$ be graph, possibly directed graph, of ...
joro's user avatar
  • 25.4k
1 vote
0 answers
122 views

Hard instances for this graph isomorphism algorithm based on powers of weighted adjacency matrices?

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 ...
joro's user avatar
  • 25.4k