A survey of graph edit distance
From MaRDI portal
Publication:710632
DOI10.1007/S10044-008-0141-YzbMATH Open1422.68211DBLPjournals/paa/GaoXTL10OpenAlexW1983681808WikidataQ62795295 ScholiaQ62795295MaRDI QIDQ710632FDOQ710632
Bing Xiao, Xinbo Gao, Xuelong Li, Dacheng Tao
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
Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on two problems in connexion with graphs
- A distance measure between attributed relational graphs for pattern recognition
- Measures of Association for Cross Classifications
- A Method for Comparing Two Hierarchical Clusterings
- Well-Separated Clusters and Optimal Fuzzy Partitions
- The String-to-String Correction Problem
- A survey on tree edit distance and related problems
- Learning Theory and Kernel Machines
- Self-organizing maps.
- Video indexing and similarity retrieval by largest common subgraph detection using decision trees
- Computing approximate tree edit distance using relaxation labeling
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Graph embedding using tree edit-union
- An eigendecomposition approach to weighted graph matching problems
- QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
- A graph distance metric combining maximum common subgraph and minimum common supergraph
- A constrained edit distance between unordered labeled trees
- Graph-Based Representations in Pattern Recognition
- Image categorization: Graph edit distance \(+\) edge direction histogram
Cited In (56)
- A new measure for the attitude to mobility of Italian students and graduates: a topological data analysis approach
- Title not available (Why is that?)
- On the decidability of finding a positive ILP-instance in a regular set of ILP-instances
- On fully diverse sets of geometric objects and graphs
- Anomaly detection in dynamic networks: a survey
- Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors and Similarity Judgment Strategies
- The edit distance for Reeb graphs of surfaces
- A distance measure for large graphs based on prime graphs
- A new clustering algorithm for coordinate-free data
- An approach for approximate subgraph matching in fuzzy RDF graph
- Graph characterization by counting sink star subgraphs
- Graph extensions, edit number and regular graphs
- Comparing large-scale graphs based on quantum probability theory
- On measuring similarity for sequences of itemsets
- Graph ambiguity
- A local branching heuristic for solving a graph edit distance problem
- Discovering recurring activity in temporal networks
- Fifty years of graph matching, network alignment and network comparison
- 3D shape retrieval using kernels on extended Reeb graphs
- Approximation of Graph Edit Distance in Quadratic Time
- Modeling the Uncertainty of a Set of Graphs Using Higher-Order Fuzzy Sets
- Comparative study on structural sensitivity of eigenvalue-based molecular descriptors
- Understanding Policy Diffusion in the U.S.: An Information-Theoretical Approach to Unveil Connectivity Structures in Slowly Evolving Complex Systems
- Covering tree with stars
- The many faces of graph dynamics
- ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
- Title not available (Why is that?)
- Determining the Hausdorff Distance Between Trees in Polynomial Time
- On the geometry of graph spaces
- Automatic Inference of Graph Transformation Rules Using the Cyclic Nature of Chemical Reactions
- Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues
- Distance metric learning for graph structured data
- Answering ``why empty? and ``why so many? queries in graph databases
- Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs
- Nonparametric statistics of dynamic networks with distinguishable nodes
- Statistical graph space analysis
- Degree reduction in labeled graph retrieval
- On structure-sensitivity of degree-based topological indices
- Improving bipartite graph edit distance approximation using various search strategies
- A taxonomy for similarity metrics between Markov decision processes
- Fast similarity search for graphs by edit distance
- From decidability to undecidability by considering regular sets of instances
- Network comparison and the within-ensemble graph distance
- An Edit Distance Between Graph Correspondences
- Model simplification for supervised classification of metabolic networks
- A comparative analysis of new graph distance measures and graph edit distance
- A long trip in the charming world of graphs for pattern recognition
- Improved Graph Edit Distance Approximation with Simulated Annealing
- Bayesian network modeling of the consensus between experts: an application to neuron classification
- Topological Feature Search in Time-Varying Multifield Data
- Distances between immersed graphs: metric properties
- Szeged and Mostar root-indices of graphs
- Graph distance measures based on topological indices revisited
- The graph matching problem
- On convex relaxation of graph isomorphism
- Title not available (Why is that?)
Uses Software
This page was built for publication: A survey of graph edit distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710632)
