A graph distance metric combining maximum common subgraph and minimum common supergraph

DOI10.1016/S0167-8655(01)00017-4zbMATH Open1010.68889OpenAlexW2071910845WikidataQ115926470 ScholiaQ115926470MaRDI QIDQ4795075FDOQ4795075

Authors: 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

Recommendations

• A graph distance metric based on the maximal common subgraph
• A metric for graphs
• scientific article; zbMATH DE number 1759531
• Graph distances using graph union
• On the minimum common supergraph of two graphs

zbMATH Keywords

graph edit distancesubgraph isomorphismmaximum common subgraphattributed relational grapherror-correcting graph matchingminimum common superoptimal graph matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Graph theory (including graph drawing) in computer science (68R10)

Cited In (18)

• Automatic learning of cost functions for graph edit distance
• Structure-based graph distance measures of high degree of precision
• A new dissimilarity measure for comparing labeled graphs
• A survey of graph edit distance
• A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance
• Applying correlation dimension to the analysis of the evolution of network structure
• Classifying transformation-variant attributed point patterns
• Title not available (Why is that?)
• A dynamic generating graphical model for point-sets matching
• Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
• On the continuity of graph parameters
• Graph similarity scoring and matching
• An algebraic view of the relation between largest common subtrees and smallest common supertrees
• Data mining for DNA viruses with breast cancer, fibroadenoma, and normal mammary tissue
• The journey of graph kernels through two decades
• On the minimum common supergraph of two graphs
• Metric for Comparison of Graph-Theoretic Models of the Same Dimension with Ordered Vertices
• Median graphs: A genetic approach based on new theoretical properties

This page was built for publication: A graph distance metric combining maximum common subgraph and minimum common supergraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4795075)