Pages that link to "Item:Q2288126"
From MaRDI portal
The following pages link to Inexact graph matching using a hierarchy of matching processes (Q2288126):
Displaying 5 items.
- Seeking affinity structure: strategies for improving \(m\)-best graph matching (Q1999054) (← links)
- On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching (Q2834517) (← links)
- (Q4808936) (← links)
- Graph matching with hierarchical discrete relaxation (Q4934137) (← links)
- Metric for Comparison of Graph-Theoretic Models of the Same Dimension with Ordered Vertices (Q5054534) (← links)
