An efficient algorithm for bounded spectral matching with affine constraint.

DOI10.1002/NLA.2264zbMATH Open1463.65151OpenAlexW2968281070MaRDI QIDQ5206499FDOQ5206499

Authors: Yan Dou, Ming Gu, S. Chandrasekaran 

Publication date: 18 December 2019

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.2264

Recommendations

• Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis
• Graph matching with nonnegative sparse model
• Lagrangian relaxation graph matching
• On spectral properties for graph matching and graph isomorphism problems
• A spectral-multiplicity-tolerant approach to robust graph matching

zbMATH Keywords

graph matchingnumerical methodoptimization problemmatrix transformationupper-bound constraintBSMAC formulation

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (1)

• Structural, Syntactic, and Statistical Pattern Recognition

This page was built for publication: An efficient algorithm for bounded spectral matching with affine constraint.

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