Continuous optimization methods for the graph isomorphism problem

DOI10.1093/IMAIAI/IAAF011MaRDI QIDQ6909017zbMATH OpenFDO

Authors Stefan Klus, Patrick Gelß

Publication date 30 October 2025

Published in Information and Inference (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

continuous optimizationconvex relaxationgraph isomorphisms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites work

• scientific article; zbMATH DE number 3307340 (Why is no real title available?)
• scientific article; zbMATH DE number 3031989 (Why is no real title available?)
• A dynamical systems approach to weighted graph matching
• A spectral assignment approach for the graph isomorphism problem
• A survey for the quadratic assignment problem
• An eigendecomposition approach to weighted graph matching problems
• Exact recovery with symmetries for the doubly stochastic relaxation
• GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM
• Graph isomorphism in quasipolynomial time (extended abstract)
• Graph isomorphism problem
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Isomorphism of planar graphs (working paper)
• On Orthogonal Matrices
• On Trivalent Graphs
• On convex relaxation of graph isomorphism
• On spectral properties for graph matching and graph isomorphism problems
• On the equivariance properties of self-adjoint matrices
• Paley and the Paley Graphs
• Procrustes Problems
• The graph isomorphism disease
• The quadratic assignment problem

This page was built for publication: Continuous optimization methods for the graph isomorphism problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909017)