On spectral properties for graph matching and graph isomorphism problems

DOI10.1093/imaiai/iav002zbMath1380.05160arXiv1409.6806OpenAlexW2963974054MaRDI QIDQ4603695

Marcelo Fiori, Guillermo Sapiro

Publication date: 19 February 2018

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

Full work available at URL: https://arxiv.org/abs/1409.6806

zbMATH Keywords

spectral propertiesconvex relaxationgraph isomorphism problemgraph matching problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

Exact Recovery with Symmetries for the Doubly Stochastic Relaxation ⋮ Efficient random graph matching via degree profiles ⋮ Exact Recovery with Symmetries for Procrustes Matching ⋮ On the equivariance properties of self-adjoint matrices ⋮ Unnamed Item

Cites Work

• Unnamed Item
• An eigendecomposition approach to weighted graph matching problems
• Graphs of Degree Three with a Given Abstract Group

This page was built for publication: On spectral properties for graph matching and graph isomorphism problems