A graph distance metric combining maximum common subgraph and minimum common supergraph
From MaRDI portal
Publication:4795075
DOI10.1016/S0167-8655(01)00017-4zbMath1010.68889OpenAlexW2071910845WikidataQ115926470 ScholiaQ115926470MaRDI QIDQ4795075
Mirtha-Lina Fernández, Gabriel Valiente
Publication date: 20 February 2003
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8655(01)00017-4
graph edit distancesubgraph isomorphismmaximum common subgraphattributed relational grapherror-correcting graph matchingminimum common superoptimal graph matching
Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)
Related Items
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 ⋮ Automatic learning of cost functions for graph edit distance ⋮ A dynamic generating graphical model for point-sets matching ⋮ A new dissimilarity measure for comparing labeled graphs ⋮ The journey of graph kernels through two decades ⋮ Applying correlation dimension to the analysis of the evolution of network structure ⋮ On the continuity of graph parameters ⋮ Structure-based graph distance measures of high degree of precision ⋮ Graph similarity scoring and matching ⋮ A survey of graph edit distance ⋮ Median graphs: A genetic approach based on new theoretical properties ⋮ Classifying transformation-variant attributed point patterns ⋮ An algebraic view of the relation between largest common subtrees and smallest common supertrees ⋮ A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance
