A graph distance metric combining maximum common subgraph and minimum common supergraph
From MaRDI portal
Publication:4795075
DOI10.1016/S0167-8655(01)00017-4zbMath1010.68889WikidataQ115926470 ScholiaQ115926470MaRDI QIDQ4795075
Gabriel Valiente, Mirtha-Lina Fernández
Publication date: 20 February 2003
Published in: Pattern Recognition Letters (Search for Journal in Brave)
graph edit distance; subgraph isomorphism; maximum common subgraph; attributed relational graph; error-correcting graph matching; minimum common super; optimal graph matching
68R10: Graph theory (including graph drawing) in computer science
68T10: Pattern recognition, speech recognition
68U99: Computing methodologies and applications
Related Items
A survey of graph edit distance, Automatic learning of cost functions for graph edit distance, A dynamic generating graphical model for point-sets matching, Structure-based graph distance measures of high degree of precision, Classifying transformation-variant attributed point patterns, A new dissimilarity measure for comparing labeled graphs, Median graphs: A genetic approach based on new theoretical properties, Data mining for DNA viruses with breast cancer, fibroadenoma, and normal mammary tissue, Graph similarity scoring and matching, An algebraic view of the relation between largest common subtrees and smallest common supertrees
