Pages that link to "Item:Q4213250"
From MaRDI portal
The following pages link to A graph distance metric based on the maximal common subgraph (Q4213250):
Displaying 40 items.
- Two approaches to determining similarity of two digraphs (Q395481) (← links)
- Effective feature construction by maximum common subgraph sampling (Q413859) (← links)
- On the continuity of graph parameters (Q479028) (← links)
- Measuring closeness of graphs -- the Hausdorff distance (Q506185) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- Automatic learning of cost functions for graph edit distance (Q867614) (← links)
- Spectral classes of regular, random, and empirical graphs (Q891525) (← links)
- 3D shape retrieval using kernels on extended Reeb graphs (Q898055) (← links)
- Structure-based graph distance measures of high degree of precision (Q947972) (← links)
- Dissimilarity between two skeletal trees in a context (Q1005641) (← links)
- On the similarity metric and the distance metric (Q1019717) (← links)
- Spectral embedding of graphs. (Q1403778) (← links)
- The \(H_0\) function, a new index for detecting structural/topological complexity information in undirected graphs (Q1619196) (← links)
- On the complexity of submap isomorphism and maximum common submap problems (Q1677051) (← links)
- The journey of graph kernels through two decades (Q1706611) (← links)
- Beyond rankings: comparing directed acyclic graphs (Q1715891) (← links)
- Cost and accuracy aware scientific workflow retrieval based on distance measure (Q1749198) (← links)
- A new dissimilarity measure for comparing labeled graphs (Q1938689) (← links)
- Fifty years of graph matching, network alignment and network comparison (Q1991876) (← links)
- Deep graph similarity learning: a survey (Q2036720) (← links)
- A new pseudometric on a subclass of Riesz spaces based on similarity measures (Q2048397) (← links)
- A new matching algorithm between trees of shapes and its application to brain tumor segmentation (Q2061786) (← links)
- Stability of the tree of shapes to additive noise (Q2061821) (← links)
- Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs (Q2163223) (← links)
- Applying correlation dimension to the analysis of the evolution of network structure (Q2213631) (← links)
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← 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)
- Data mining for DNA viruses with breast cancer, fibroadenoma, and normal mammary tissue (Q2371513) (← links)
- The graph matching problem (Q2444585) (← links)
- Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues (Q2657102) (← links)
- Quantum walk inspired algorithm for graph similarity and isomorphism (Q2681642) (← links)
- Cumulative disease progression models for cross-sectional data: A review and comparison (Q2919463) (← links)
- New dissimilarity measure for recognizing noisy subsequence trees (Q2997938) (← links)
- A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs (Q4611386) (← links)
- ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns (Q4969622) (← links)
- Determining the Hausdorff Distance Between Trees in Polynomial Time (Q5024666) (← links)
- Metric for Comparison of Graph-Theoretic Models of the Same Dimension with Ordered Vertices (Q5054534) (← links)
- Network comparison and the within-ensemble graph distance (Q5161157) (← links)
- Non-Euclidean Dissimilarities: Causes, Embedding and Informativeness (Q5253998) (← links)