A mixed-integer convex formulation for graph isomorphism is solved via first-order methods and variable fixing, outperforming integer feasibility on 6 of 12 graph families and matching on symmetric ones.
Proceedings of the National Academy of Sciences112(10), 2942–2947 (2015)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods
A mixed-integer convex formulation for graph isomorphism is solved via first-order methods and variable fixing, outperforming integer feasibility on 6 of 12 graph families and matching on symmetric ones.