The authors propose an SDP relaxation of the clique formulation of graph isomorphism and claim that its optimal value either reaches n^2 or falls to n(n-1), giving a polynomial-time test.
Linear Time Algorithm for Isomorphism of Planar Graphs,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Revisiting the Graph Isomorphism Problem with Semidefinite Programming
The authors propose an SDP relaxation of the clique formulation of graph isomorphism and claim that its optimal value either reaches n^2 or falls to n(n-1), giving a polynomial-time test.