A graph distance metric based on the maximal common subgraph
From MaRDI portal
Publication:4213250
DOI10.1016/S0167-8655(97)00179-7zbMath0905.68128OpenAlexW2012459404MaRDI QIDQ4213250
Publication date: 13 October 1998
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8655(97)00179-7
Related Items
The \(H_0\) function, a new index for detecting structural/topological complexity information in undirected graphs ⋮ Data mining for DNA viruses with breast cancer, fibroadenoma, and normal mammary tissue ⋮ Metric for Comparison of Graph-Theoretic Models of the Same Dimension with Ordered Vertices ⋮ Cumulative disease progression models for cross-sectional data: A review and comparison ⋮ Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs ⋮ Automatic learning of cost functions for graph edit distance ⋮ Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues ⋮ On the complexity of submap isomorphism and maximum common submap problems ⋮ Two approaches to determining similarity of two digraphs ⋮ Spectral classes of regular, random, and empirical graphs ⋮ Quantum walk inspired algorithm for graph similarity and isomorphism ⋮ A new dissimilarity measure for comparing labeled graphs ⋮ Effective feature construction by maximum common subgraph sampling ⋮ 3D shape retrieval using kernels on extended Reeb graphs ⋮ Spectral embedding of graphs. ⋮ The journey of graph kernels through two decades ⋮ A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs ⋮ Applying correlation dimension to the analysis of the evolution of network structure ⋮ Beyond rankings: comparing directed acyclic graphs ⋮ The graph matching problem ⋮ On the continuity of graph parameters ⋮ New dissimilarity measure for recognizing noisy subsequence trees ⋮ Structure-based graph distance measures of high degree of precision ⋮ Measuring closeness of graphs -- the Hausdorff distance ⋮ Cost and accuracy aware scientific workflow retrieval based on distance measure ⋮ Fifty years of graph matching, network alignment and network comparison ⋮ Network comparison and the within-ensemble graph distance ⋮ A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics ⋮ A distance measure for large graphs based on prime graphs ⋮ Spectral graph features for the classification of graphs and graph sequences ⋮ Median graphs: A genetic approach based on new theoretical properties ⋮ Deep graph similarity learning: a survey ⋮ Dissimilarity between two skeletal trees in a context ⋮ A new pseudometric on a subclass of Riesz spaces based on similarity measures ⋮ ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns ⋮ On the similarity metric and the distance metric ⋮ A new matching algorithm between trees of shapes and its application to brain tumor segmentation ⋮ Stability of the tree of shapes to additive noise ⋮ Non-Euclidean Dissimilarities: Causes, Embedding and Informativeness ⋮ Determining the Hausdorff Distance Between Trees in Polynomial Time
