Seeking affinity structure: strategies for improving \(m\)-best graph matching (Q1999054)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Seeking affinity structure: strategies for improving \(m\)-best graph matching |
scientific article; zbMATH DE number 7324642
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Seeking affinity structure: strategies for improving \(m\)-best graph matching |
scientific article; zbMATH DE number 7324642 |
Statements
Seeking affinity structure: strategies for improving \(m\)-best graph matching (English)
0 references
18 March 2021
0 references
\(m\)-best graph matching
0 references
binary-tree partitions
0 references
QAP
0 references
0.88313246
0 references
0.87828267
0 references
0.8614241
0 references
0.8583152
0 references
0.85685384
0 references
