# Is there an efficient algorithm to check whether a matrix is symmetrizable using only permutation matrix?

Is there any known efficient algorithm (something that works better than brute-force algorithm) to check that given a $(0,1)$-$d \times d$ matrix $A$, is there a permutation matrix $P$ of the same size such that $PA$ is a symmetric matrix? I believe this question might have been done in the past (probably even for a more general matrix), however I can not find any literature that is connected to this problem.

-
Bhat, Kabekode VS. "An algorithm for matrix symmetrization." Journal of the Franklin Institute 312.1 (1981): 89-93. – Waldemar Jan 23 '14 at 10:04
Thanks! This is what I am looking for. – sweehong Jan 23 '14 at 10:26

Interestingly, if we ask instead whether there is a permutation matrix $P$ such that $PA$ is the transpose of $A$, that is equivalent to the graph isomorphism problem.