Pages that link to "Item:Q1678686"
From MaRDI portal
The following pages link to Improving bipartite graph edit distance approximation using various search strategies (Q1678686):
Displaying 5 items.
- Improving bipartite graph edit distance approximation using various search strategies (Q1678686) (← links)
- A local branching heuristic for solving a graph edit distance problem (Q1734846) (← links)
- EmbAssi: embedding assignment costs for similarity search in large graph databases (Q2097444) (← links)
- Improved Graph Edit Distance Approximation with Simulated Annealing (Q5082159) (← links)
- Bipartite Graph Matching for Computing the Edit Distance of Graphs (Q5325713) (← links)