Seeking affinity structure: strategies for improving \(m\)-best graph matching
type: Item
instance of: scholarly article
title: Seeking affinity structure: strategies for improving \(m\)-best graph matching
zbMATH Open document ID: 1456.90167
author: Manuel Curado
author: F. Escolano
author: Miguel A. Lozano
author: Edwin R. Hancock
published in: Information Sciences
publication date: 2021-03-18T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7324642
zbMATH Keywords: \(m\)-best graph matching
zbMATH Keywords: binary-tree partitions
zbMATH Keywords: QAP
MaRDI profile type: Publication
full work available at URL: j.ins.2019.09.014
OpenAlex ID: W2972325703
cites work: The quadratic assignment problem
cites work: Unsupervised learning for graph matching
DOI: 10.1016/J.INS.2019.09.014
Recommended article: Density Maximization for Improving Graph Matching With Its Applications
Recommended article: On the use of similarity metrics for approximate graph matching
Recommended article: Q4294616
Recommended article: Inexact graph matching using a hierarchy of matching processes
Recommended article: Q4786059
Recommended article: Using local similarity measures to efficiently address approximate graph matching
Recommended article: Algorithms for approximate graph matching
description: scientific article; zbMATH DE number 7324642