A distance measure between attributed relational graphs for pattern recognition
From MaRDI portal
Publication:4749230
DOI10.1109/TSMC.1983.6313167zbMath0511.68060WikidataQ61737946 ScholiaQ61737946MaRDI QIDQ4749230
Publication date: 1983
Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)
Related Items
Matching graphs with unique node labels, On effectiveness of wiretap programs in mapping social networks, Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance, Automatic learning of cost functions for graph edit distance, Similarity and dissimilarity measures of basic uncertain information and their applications in group decision-making, An Edit Distance Between Graph Correspondences, Fast similarity search for graphs by edit distance, 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, Object recognition using wavelets, L-G graphs and synthesis of regions, Improving bipartite graph edit distance approximation using various search strategies, Interactive graph-matching using active query strategies, A new dissimilarity measure for comparing labeled graphs, Spectral embedding of graphs., Amoeba Techniques for Shape and Texture Analysis, Distances between immersed graphs: metric properties, Szeged and Mostar root-indices of graphs, The graph matching problem, Isomorphism testing via polynomial-time graph extensions, Image categorization: Graph edit distance \(+\) edge direction histogram, A study of graph spectra for comparing graphs and trees, Approximation of Graph Edit Distance in Quadratic Time, A convex relaxation bound for subgraph isomorphism, Using local similarity measures to efficiently address approximate graph matching, Matching Delaunay graphs, Fixed point limits of self-similar network sequences, Generalized median graph computation by means of graph embedding in vector spaces, A distance measure for large graphs based on prime graphs, Spectral graph features for the classification of graphs and graph sequences, A survey of graph edit distance, Median graphs: A genetic approach based on new theoretical properties, Object and image indexing based on region connection calculus and oriented matroid theory, Edit distance-based kernel functions for structural pattern classification, Model-based stroke extraction and matching for handwritten Chinese character recognition, Least-commitment graph matching with genetic algorithms, Graph Similarity through Entropic Manifold Alignment, Graph-based representations and techniques for image processing and image analysis, Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs, Graph matching using the interference of continuous-time quantum walks, A Recursive Embedding Approach to Median Graph Computation, Complex intuitionistic fuzzy ordered weighted distance measure, Relational object recognition from large structural libraries, Graph comparison via nonlinear quantum search, A tunable distance measure for coloured solid models, A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance, Convex graph invariant relaxations for graph edit distance
