On convex relaxation of graph isomorphism

DOI10.1073/PNAS.1401651112zbMATH Open1355.05237OpenAlexW1973926472WikidataQ30629093 ScholiaQ30629093MaRDI QIDQ2962278FDOQ2962278

Authors: Yonathan Aflalo, Alexander M. Bronstein, 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

Recommendations

• Exact recovery with symmetries for the doubly stochastic relaxation
• On spectral properties for graph matching and graph isomorphism problems
• Graph matching by simplified convex-concave relaxation procedure
• A convex relaxation bound for subgraph isomorphism
• scientific article; zbMATH DE number 2040635

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching
• A survey of graph edit distance
• Mining Graph Data
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Spectral multidimensional scaling

Cited In (21)

• A general system for heuristic minimization of convex functions over non-convex sets
• Convex graph invariant relaxations for graph edit distance
• Title not available (Why is that?)
• Exact recovery with symmetries for procrustes matching
• Semidefinite programming approach for the quadratic assignment problem with a sparse graph
• A dynamical systems approach to weighted graph matching
• Title not available (Why is that?)
• Efficient random graph matching via degree profiles
• 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
• Efficient estimation of the modified Gromov-Hausdorff distance between unweighted graphs
• Sparse models for intrinsic shape correspondence
• Graph matching by simplified convex-concave relaxation procedure
• An algorithm for weighted sub-graph matching based on gradient flows
• Linearly scalable learning of smooth low-dimensional patterns with permutation-aided entropic dimension reduction
• Subgraph Matching with Semidefinite Programming
• On spectral properties for graph matching and graph isomorphism problems
• Network alignment by discrete Ollivier-Ricci flow
• A convex relaxation bound for subgraph isomorphism
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Exact recovery with symmetries for the doubly stochastic relaxation

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

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