On spectral properties for graph matching and graph isomorphism problems

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

Guillermo Sapiro, Marcelo Fiori

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 properties; convex relaxation; graph isomorphism problem; graph matching problem

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)