Pages that link to "Item:Q496650"
From MaRDI portal
The following pages link to Using local similarity measures to efficiently address approximate graph matching (Q496650):
Displaying 9 items.
- An efficient algorithm to recognize locally equivalent graphs (Q1181011) (← 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)
- Graph similarity scoring and matching (Q2472827) (← links)
- On the use of similarity metrics for approximate graph matching (Q2883637) (← links)
- A similarity search technique for graph set (Q3131824) (← links)
- RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs (Q4415912) (← links)
- Graph-Based Representations in Pattern Recognition (Q5316454) (← links)