Pages that link to "Item:Q867614"
From MaRDI portal
The following pages link to Automatic learning of cost functions for graph edit distance (Q867614):
Displayed 9 items.
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- Path lengths in tree-child time consistent hybridization networks (Q845330) (← links)
- Structure-based graph distance measures of high degree of precision (Q947972) (← links)
- Dissimilarity between two skeletal trees in a context (Q1005641) (← links)
- Approximation of graph edit distance based on Hausdorff matching (Q1677056) (← links)
- The journey of graph kernels through two decades (Q1706611) (← links)
- Distance metric learning for graph structured data (Q2071320) (← links)
- Graph characterization by counting sink star subgraphs (Q2360843) (← links)
- The graph matching problem (Q2444585) (← links)