Pages that link to "Item:Q4747553"
From MaRDI portal
The following pages link to Inexact graph matching for structural pattern recognition (Q4747553):
Displayed 25 items.
- Learning loopy graphical models with latent variables: efficient methods and guarantees (Q355078) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- Recent advances in graph-based pattern recognition with applications in document analysis (Q632592) (← links)
- A similarity measure for graphs with low computational complexity (Q861127) (← links)
- Automatic learning of cost functions for graph edit distance (Q867614) (← links)
- Generalized median graph computation by means of graph embedding in vector spaces (Q962746) (← links)
- A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees (Q1636844) (← links)
- Approximation of graph edit distance based on Hausdorff matching (Q1677056) (← links)
- Improving bipartite graph edit distance approximation using various search strategies (Q1678686) (← links)
- The journey of graph kernels through two decades (Q1706611) (← links)
- A local branching heuristic for solving a graph edit distance problem (Q1734846) (← links)
- Fifty years of graph matching, network alignment and network comparison (Q1991876) (← links)
- Deep graph similarity learning: a survey (Q2036720) (← links)
- Spectral graph features for the classification of graphs and graph sequences (Q2259697) (← links)
- Median graphs: A genetic approach based on new theoretical properties (Q2270833) (← links)
- Comparing large graphs efficiently by margins of feature vectors (Q2372051) (← links)
- The graph matching problem (Q2444585) (← links)
- A comparative analysis of multidimensional features of objects resembling sets of graphs (Q2474878) (← links)
- A dynamic programming algorithm for the tree mapping problem (Q2840699) (← links)
- Topology discovery of sparse random graphs with few participants (Q2844081) (← links)
- Approximation of Graph Edit Distance in Quadratic Time (Q3300141) (← links)
- A Recursive Embedding Approach to Median Graph Computation (Q3637694) (← links)
- Improving Graph Classification by Isomap (Q3637702) (← links)
- Improved Graph Edit Distance Approximation with Simulated Annealing (Q5082159) (← links)
- Reachability in big graphs: a distributed indexing and querying approach (Q6065881) (← links)