Pages that link to "Item:Q2472827"
From MaRDI portal
The following pages link to Graph similarity scoring and matching (Q2472827):
Displaying 20 items.
- Similarity in languages and programs (Q391201) (← links)
- Using local similarity measures to efficiently address approximate graph matching (Q496650) (← links)
- Quantitative graph theory: a new branch of graph theory and network science (Q780939) (← links)
- Similarity matrices for colored graphs (Q1043704) (← links)
- Graph nodes and a definition of structural similarity (Q1103651) (← links)
- Tracking network dynamics: a survey using graph distances (Q1624818) (← links)
- A method for agent-based models validation (Q1655690) (← links)
- Estimating a graphical intra-class correlation coefficient (GICC) using multivariate probit-linear mixed models (Q1663261) (← links)
- Cost and accuracy aware scientific workflow retrieval based on distance measure (Q1749198) (← links)
- Fifty years of graph matching, network alignment and network comparison (Q1991876) (← links)
- Dynamic Katz and related network measures (Q2085424) (← links)
- On efficient network similarity measures (Q2286037) (← links)
- Comparing large graphs efficiently by margins of feature vectors (Q2372051) (← links)
- Efficient identifications of structural similarities for graphs (Q2444149) (← links)
- On the use of similarity metrics for approximate graph matching (Q2883637) (← links)
- Graph unification and matching (Q4645268) (← links)
- Toward Quantifying Vertex Similarity in Networks (Q4985357) (← links)
- Beyond non-backtracking: non-cycling network centrality measures (Q5160872) (← links)
- Graph-Based Representations in Pattern Recognition (Q5316454) (← links)
- Generalised heat kernel invariants of a graph and application to object clustering (Q6553616) (← links)
