30 citations · 89 across the 18 of their papers we have counts for
1 paper · 1 filter
Shmuel Friedland
We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given n×n matrices, is equivalent to equ…