Inexact graph matching for structural pattern recognition

DOI10.1016/0167-8655(83)90033-8zbMath0509.68100OpenAlexW1975844474MaRDI QIDQ4747553

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

heuristic searchattributed graphsinexact matchingsilhouette recognition

Mathematics Subject Classification ID

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

Related Items (26)

Comparing large graphs efficiently by margins of feature vectors ⋮ A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees ⋮ A similarity measure for graphs with low computational complexity ⋮ Learning loopy graphical models with latent variables: efficient methods and guarantees ⋮ Automatic learning of cost functions for graph edit distance ⋮ Improved Graph Edit Distance Approximation with Simulated Annealing ⋮ Approximation of graph edit distance based on Hausdorff matching ⋮ Improving bipartite graph edit distance approximation using various search strategies ⋮ 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 ⋮ The journey of graph kernels through two decades ⋮ The graph matching problem ⋮ A local branching heuristic for solving a graph edit distance problem ⋮ Approximation of Graph Edit Distance in Quadratic Time ⋮ Fifty years of graph matching, network alignment and network comparison ⋮ A comparative analysis of multidimensional features of objects resembling sets of graphs ⋮ 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 ⋮ Median graphs: A genetic approach based on new theoretical properties ⋮ Deep graph similarity learning: a survey ⋮ A Recursive Embedding Approach to Median Graph Computation ⋮ Improving Graph Classification by Isomap ⋮ A dynamic programming algorithm for the tree mapping problem ⋮ Topology discovery of sparse random graphs with few participants

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