Pages that link to "Item:Q4795075"
From MaRDI portal
The following pages link to A graph distance metric combining maximum common subgraph and minimum common supergraph (Q4795075):
Displayed 10 items.
- A survey of graph edit distance (Q710632) (← links)
- Automatic learning of cost functions for graph edit distance (Q867614) (← links)
- A dynamic generating graphical model for point-sets matching (Q872376) (← links)
- Structure-based graph distance measures of high degree of precision (Q947972) (← links)
- Classifying transformation-variant attributed point patterns (Q991264) (← links)
- A new dissimilarity measure for comparing labeled graphs (Q1938689) (← 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)
- Graph similarity scoring and matching (Q2472827) (← links)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)