A distance measure between attributed relational graphs for pattern recognition
From MaRDI portal
Cited in
(56)- Graph matching using the interference of continuous-time quantum walks
- A tunable distance measure for coloured solid models
- Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs
- Spectral embedding of graphs.
- Ricci flow embedding for rectifying non-Euclidean dissimilarity data
- A long trip in the charming world of graphs for pattern recognition
- Approximation of graph edit distance based on Hausdorff matching
- Improving bipartite graph edit distance approximation using various search strategies
- Interactive graph-matching using active query strategies
- Object and image indexing based on region connection calculus and oriented matroid theory
- Relational object recognition from large structural libraries
- A new dissimilarity measure for comparing labeled graphs
- Complex intuitionistic fuzzy ordered weighted distance measure
- Graph comparison via nonlinear quantum search
- Convex graph invariant relaxations for graph edit distance
- Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance
- Similarity and dissimilarity measures of basic uncertain information and their applications in group decision-making
- Fast similarity search for graphs by edit distance
- Spectral graph features for the classification of graphs and graph sequences
- Median graphs: A genetic approach based on new theoretical properties
- The graph matching problem
- Edit distance-based kernel functions for structural pattern classification
- Distances between immersed graphs: metric properties
- Szeged and Mostar root-indices of graphs
- Approximation of graph edit distance in quadratic time
- A Recursive Embedding Approach to Median Graph Computation
- Amoeba techniques for shape and texture analysis
- Graph similarity through entropic manifold alignment
- Using local similarity measures to efficiently address approximate graph matching
- A linear-time algorithm and analysis of graph relative Hausdorff distance
- An edit distance between graph correspondences
- Fixed point limits of self-similar network sequences
- A distance measure for large graphs based on prime graphs
- Model-based stroke extraction and matching for handwritten Chinese character recognition
- Least-commitment graph matching with genetic algorithms
- Graph-based representations and techniques for image processing and image analysis
- Comparing planning domain models using answer set programming
- On the perception of small sub-graphs
- Distance measures for geometric graphs
- Whole-graph embedding and adversarial attacks for life sciences
- Isomorphism testing via polynomial-time graph extensions
- Learning stability on graphs
- A convex relaxation bound for subgraph isomorphism
- Matching Delaunay graphs
- Hypothesis testing for two sample comparison of non Euclidean network data
- On the Wiener-like root-indices of graphs
- Algorithms for optimally shifting intervals under intersection graph models
- A survey of graph edit distance
- Efficient graph similarity assessment method based on vectors of topological indices
- Matching graphs with unique node labels
- On effectiveness of wiretap programs in mapping social networks
- Automatic learning of cost functions for graph edit distance
- Object recognition using wavelets, L-G graphs and synthesis of regions
- Image categorization: Graph edit distance \(+\) edge direction histogram
- A study of graph spectra for comparing graphs and trees
- Generalized median graph computation by means of graph embedding in vector spaces
This page was built for publication: A distance measure between attributed relational graphs for pattern recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4749230)
