A survey of graph edit distance

DOI10.1007/s10044-008-0141-yzbMath1422.68211OpenAlexW1983681808WikidataQ62795295 ScholiaQ62795295MaRDI QIDQ710632

Bing Xiao, Xuelong Li, Dacheng Tao, XinBo Gao

Publication date: 19 October 2010

Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10044-008-0141-y

zbMATH Keywords

graph edit distance attributed graph inexact graph matching non-attributed graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items

Graph characterization by counting sink star subgraphs, Comparative study on structural sensitivity of eigenvalue-based molecular descriptors, On the geometry of graph spaces, Automatic Inference of Graph Transformation Rules Using the Cyclic Nature of Chemical Reactions, Understanding Policy Diffusion in the U.S.: An Information-Theoretical Approach to Unveil Connectivity Structures in Slowly Evolving Complex Systems, Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs, Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues, An Edit Distance Between Graph Correspondences, Nonparametric statistics of dynamic networks with distinguishable nodes, Fast similarity search for graphs by edit distance, A long trip in the charming world of graphs for pattern recognition, Improving bipartite graph edit distance approximation using various search strategies, Statistical graph space analysis, On fully diverse sets of geometric objects and graphs, Answering ``why empty? and ``why so many? queries in graph databases, A taxonomy for similarity metrics between Markov decision processes, A new measure for the attitude to mobility of Italian students and graduates: a topological data analysis approach, 3D shape retrieval using kernels on extended Reeb graphs, On convex relaxation of graph isomorphism, Distances between immersed graphs: metric properties, Szeged and Mostar root-indices of graphs, On measuring similarity for sequences of itemsets, The graph matching problem, Graph ambiguity, Unnamed Item, On structure-sensitivity of degree-based topological indices, Graph extensions, edit number and regular graphs, Modeling the Uncertainty of a Set of Graphs Using Higher-Order Fuzzy Sets, Approximation of Graph Edit Distance in Quadratic Time, The many faces of graph dynamics, Graph distance measures based on topological indices revisited, Discovering recurring activity in temporal networks, Fifty years of graph matching, network alignment and network comparison, Network comparison and the within-ensemble graph distance, A new clustering algorithm for coordinate-free data, A distance measure for large graphs based on prime graphs, Unnamed Item, Comparing large-scale graphs based on quantum probability theory, A comparative analysis of new graph distance measures and graph edit distance, Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors and Similarity Judgment Strategies, Model simplification for supervised classification of metabolic networks, On the decidability of finding a positive ILP-instance in a regular set of ILP-instances, From decidability to undecidability by considering regular sets of instances, Degree Reduction in Labeled Graph Retrieval, Distance metric learning for graph structured data, An approach for approximate subgraph matching in fuzzy RDF graph, Topological Feature Search in Time-Varying Multifield Data, Determining the Hausdorff Distance Between Trees in Polynomial Time, Bayesian network modeling of the consensus between experts: an application to neuron classification, Covering tree with stars, The edit distance for Reeb graphs of surfaces

Uses Software

SDPA

Cites Work