Continuous optimization methods for the graph isomorphism problem

Stefan Klus, Patrick Gelß

The graph isomorphism problem looks deceptively simple, but although polynomial-time algorithms exist for certain types of graphs such as planar graphs and graphs with bounded degr…