The following pages link to A survey of graph edit distance (Q710632):
Displaying 50 items.
- The edit distance for Reeb graphs of surfaces (Q262316) (← links)
- On the geometry of graph spaces (Q317419) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- Graph distance measures based on topological indices revisited (Q669403) (← links)
- Comparative study on structural sensitivity of eigenvalue-based molecular descriptors (Q830841) (← links)
- Answering ``why empty?'' and ``why so many?'' queries in graph databases (Q891677) (← links)
- 3D shape retrieval using kernels on extended Reeb graphs (Q898055) (← links)
- A new clustering algorithm for coordinate-free data (Q962672) (← links)
- A long trip in the charming world of graphs for pattern recognition (Q1677050) (← links)
- Improving bipartite graph edit distance approximation using various search strategies (Q1678686) (← links)
- On measuring similarity for sequences of itemsets (Q1715867) (← links)
- Graph extensions, edit number and regular graphs (Q1732121) (← links)
- A local branching heuristic for solving a graph edit distance problem (Q1734846) (← links)
- Discovering recurring activity in temporal networks (Q1741356) (← links)
- Fifty years of graph matching, network alignment and network comparison (Q1991876) (← links)
- From decidability to undecidability by considering regular sets of instances (Q2062120) (← links)
- Distance metric learning for graph structured data (Q2071320) (← links)
- Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs (Q2163223) (← links)
- Fast similarity search for graphs by edit distance (Q2174059) (← links)
- Comparing large-scale graphs based on quantum probability theory (Q2279341) (← links)
- A comparative analysis of new graph distance measures and graph edit distance (Q2293189) (← links)
- Model simplification for supervised classification of metabolic networks (Q2294595) (← links)
- An approach for approximate subgraph matching in fuzzy RDF graph (Q2329097) (← links)
- Bayesian network modeling of the consensus between experts: an application to neuron classification (Q2353970) (← links)
- Covering tree with stars (Q2354301) (← links)
- Graph characterization by counting sink star subgraphs (Q2360843) (← links)
- Nonparametric statistics of dynamic networks with distinguishable nodes (Q2404165) (← links)
- Statistical graph space analysis (Q2417832) (← links)
- The graph matching problem (Q2444585) (← links)
- Graph ambiguity (Q2446033) (← links)
- On structure-sensitivity of degree-based topological indices (Q2453294) (← links)
- Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues (Q2657102) (← links)
- Distances between immersed graphs: metric properties (Q2691630) (← links)
- Szeged and Mostar root-indices of graphs (Q2700357) (← links)
- Degree reduction in labeled graph retrieval (Q2828204) (← links)
- On convex relaxation of graph isomorphism (Q2962278) (← links)
- Automatic Inference of Graph Transformation Rules Using the Cyclic Nature of Chemical Reactions (Q3187812) (← links)
- Understanding Policy Diffusion in the U.S.: An Information-Theoretical Approach to Unveil Connectivity Structures in Slowly Evolving Complex Systems (Q3188149) (← links)
- Modeling the Uncertainty of a Set of Graphs Using Higher-Order Fuzzy Sets (Q3299861) (← links)
- Approximation of Graph Edit Distance in Quadratic Time (Q3300141) (← links)
- The many faces of graph dynamics (Q3303089) (← links)
- (Q4450795) (← links)
- ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS (Q4888367) (← links)
- Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors and Similarity Judgment Strategies (Q4961760) (← links)
- Determining the Hausdorff Distance Between Trees in Polynomial Time (Q5024666) (← links)
- (Q5075776) (← links)
- Improved Graph Edit Distance Approximation with Simulated Annealing (Q5082159) (← links)
- An Edit Distance Between Graph Correspondences (Q5082160) (← links)
- Network comparison and the within-ensemble graph distance (Q5161157) (← links)
- Topological Feature Search in Time-Varying Multifield Data (Q5861930) (← links)
