We present a new energy-minimization framework for the graph isomor- phism problem that is based on an equivalent maximum clique formu- lation. The approach is centered around a fundamental result proved by Motzkin and Straus in the mid-1960s, and recently expanded in various Ways, which allows us to formulate the maximum clique problem in terms Of a standard quadratic program. The attractive feature of this formulation Is that a clear one-to-one correspondence exists between the solutions of The quadratic program and those in the original, combinatorial problem.
展开▼
