Pages that link to "Item:Q3300141"
From MaRDI portal
The following pages link to Approximation of Graph Edit Distance in Quadratic Time (Q3300141):
Displaying 3 items.
- EmbAssi: embedding assignment costs for similarity search in large graph databases (Q2097444) (← links)
- Improved Graph Edit Distance Approximation with Simulated Annealing (Q5082159) (← links)
- Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching (Q6199741) (← links)