Pages that link to "Item:Q518686"
From MaRDI portal
The following pages link to Structural pattern recognition with graph edit distance. Approximation algorithms and applications (Q518686):
Displaying 9 items.
- A survey of graph edit distance (Q710632) (← links)
- Approximation of graph edit distance based on Hausdorff matching (Q1677056) (← links)
- Edit distance-based kernel functions for structural pattern classification (Q2498678) (← links)
- (Q4450795) (← links)
- Node Matching Computation Between Two Large Graphs in Linear Computational Cost (Q5082148) (← links)
- Fast Nearest Neighbors Search in Graph Space Based on a Branch-and-Bound Strategy (Q5082156) (← links)
- Improved Graph Edit Distance Approximation with Simulated Annealing (Q5082159) (← links)
- Structural, Syntactic, and Statistical Pattern Recognition (Q5466305) (← links)
- Weighted mean of a pair of graphs (Q5958908) (← links)