Pages that link to "Item:Q2883637"
From MaRDI portal
The following pages link to On the use of similarity metrics for approximate graph matching (Q2883637):
Displaying 10 items.
- Using local similarity measures to efficiently address approximate graph matching (Q496650) (← links)
- Algorithms for approximate graph matching (Q1357079) (← links)
- A comparative study of ant colony optimization and reactive search for graph matching problems (Q1742614) (← links)
- Seeking affinity structure: strategies for improving \(m\)-best graph matching (Q1999054) (← links)
- Efficient identifications of structural similarities for graphs (Q2444149) (← links)
- Graph similarity scoring and matching (Q2472827) (← links)
- On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching (Q2834517) (← links)
- On the use of similarity metrics for approximate graph matching (Q2883637) (← links)
- Graph-Based Representations in Pattern Recognition (Q5316454) (← links)
- Graph-Based Representations in Pattern Recognition (Q5316471) (← links)