Seeking affinity structure: strategies for improving \(m\)-best graph matching

DOI10.1016/J.INS.2019.09.014zbMath1456.90167OpenAlexW2972325703MaRDI QIDQ1999054

Miguel A. Lozano, Manuel Curado, Edwin R. Hancock, F. Escolano

Publication date: 18 March 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2019.09.014

zbMATH Keywords

QAP\(m\)-best graph matchingbinary-tree partitions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unsupervised learning for graph matching
• The Quadratic Assignment Problem

This page was built for publication: Seeking affinity structure: strategies for improving \(m\)-best graph matching