Inexact graph matching for structural pattern recognition

DOI10.1016/0167-8655(83)90033-8MaRDI QIDQ4747553zbMATH OpenOpenAlexFDO

Authors G. Allermann, Horst Bunke

Publication date 1983

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8655(83)90033-8

zbMATH Keywords

attributed graphsheuristic searchinexact matchingsilhouette recognition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Pattern recognition, speech recognition (68T10)

Cited in

(27)

• A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
• Approximation of graph edit distance based on Hausdorff matching
• Improving bipartite graph edit distance approximation using various search strategies
• The journey of graph kernels through two decades
• A local branching heuristic for solving a graph edit distance problem
• Fifty years of graph matching, network alignment and network comparison
• Deep graph similarity learning: a survey
• Spectral graph features for the classification of graphs and graph sequences
• Median graphs: A genetic approach based on new theoretical properties
• Comparing large graphs efficiently by margins of feature vectors
• The graph matching problem
• A comparative analysis of multidimensional features of objects resembling sets of graphs
• A dynamic programming algorithm for the tree mapping problem
• Topology discovery of sparse random graphs with few participants
• Approximation of graph edit distance in quadratic time
• Learning loopy graphical models with latent variables: efficient methods and guarantees
• A Recursive Embedding Approach to Median Graph Computation
• Improving Graph Classification by Isomap
• Improved Graph Edit Distance Approximation with Simulated Annealing
• A distance measure for large graphs based on prime graphs
• Reachability in big graphs: a distributed indexing and querying approach
• Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching
• Recent advances in graph-based pattern recognition with applications in document analysis
• Distance measures for geometric graphs
• A similarity measure for graphs with low computational complexity
• Automatic learning of cost functions for graph edit distance
• Generalized median graph computation by means of graph embedding in vector spaces

This page was built for publication: Inexact graph matching for structural pattern recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4747553)