Pages that link to "Item:Q5082159"
From MaRDI portal
The following pages link to Improved Graph Edit Distance Approximation with Simulated Annealing (Q5082159):
Displaying 5 items.
- Using local similarity measures to efficiently address approximate graph matching (Q496650) (← links)
- A survey of graph edit distance (Q710632) (← links)
- A local branching heuristic for solving a graph edit distance problem (Q1734846) (← links)
- Convex graph invariant relaxations for graph edit distance (Q2118089) (← links)
- On the use of similarity metrics for approximate graph matching (Q2883637) (← links)