A graph distance metric combining maximum common subgraph and minimum common supergraph
From MaRDI portal
Publication:4795075
Recommendations
Cited in
(19)- Graph similarity scoring and matching
- Metric for comparing graphs with ordered vertices based on the maximum common subgraph
- Automatic learning of cost functions for graph edit distance
- A survey of graph edit distance
- The journey of graph kernels through two decades
- A linear-time algorithm and analysis of graph relative Hausdorff distance
- Median graphs: A genetic approach based on new theoretical properties
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- A dynamic generating graphical model for point-sets matching
- Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
- Metric for comparison of graph-theoretic models of the same dimension with ordered vertices
- Structure-based graph distance measures of high degree of precision
- A new dissimilarity measure for comparing labeled graphs
- Applying correlation dimension to the analysis of the evolution of network structure
- scientific article; zbMATH DE number 1759532 (Why is no real title available?)
- Data mining for DNA viruses with breast cancer, fibroadenoma, and normal mammary tissue
- On the minimum common supergraph of two graphs
- On the continuity of graph parameters
- Classifying transformation-variant attributed point patterns
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)