On convex relaxation of graph isomorphism

DOI10.1073/pnas.1401651112zbMath1355.05237OpenAlexW1973926472WikidataQ30629093 ScholiaQ30629093MaRDI QIDQ2962278

Alexander M. Bronstein, Yonathan Aflalo, Ron Kimmel

Publication date: 16 February 2017

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.1401651112

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Exact Recovery with Symmetries for the Doubly Stochastic Relaxation ⋮ Efficient random graph matching via degree profiles ⋮ An algorithm for weighted sub-graph matching based on gradient flows ⋮ Exact Recovery with Symmetries for Procrustes Matching ⋮ Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis ⋮ Spectral graph matching and regularized quadratic relaxations. II: Erdős-Rényi graphs and universality ⋮ Sparse Models for Intrinsic Shape Correspondence ⋮ Network alignment by discrete Ollivier-Ricci flow ⋮ A general system for heuristic minimization of convex functions over non-convex sets ⋮ Semidefinite programming approach for the quadratic assignment problem with a sparse graph ⋮ Unnamed Item

Cites Work

• Unnamed Item
• A survey of graph edit distance
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Mining Graph Data
• Spectral multidimensional scaling
• Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching

This page was built for publication: On convex relaxation of graph isomorphism