Approximation of graph edit distance based on Hausdorff matching
DOI10.1016/j.patcog.2014.07.015zbMath1373.68350OpenAlexW1996551363MaRDI QIDQ1677056
Kaspar Riesen, Andreas Fischer, Volkmar Frinken, Horst Bunke, Ching-Yun Suen
Publication date: 10 November 2017
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2014.07.015
approximation algorithmsHausdorff distancehandwriting recognitiongraph embeddinggraph edit distancegraph classification
Pattern recognition, speech recognition (68T10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching graphs with unique node labels
- Automatic learning of cost functions for graph edit distance
- Applied graph theory in computer vision and pattern recognition
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching
- Algorithms for the Assignment and Transportation Problems
- Graph Classification and Clustering Based on Vector Space Embedding
- An eigendecomposition approach to weighted graph matching problems
- Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis
- An Algorithm for Subgraph Isomorphism
- The String-to-String Correction Problem
- Inexact graph matching for structural pattern recognition
- A distance measure between attributed relational graphs for pattern recognition
- A One Hour Trip in the World of Graphs, Looking at the Papers of the Last Ten Years
- A Novel Software Toolkit for Graph Edit Distance Computation
- A Fast Matching Algorithm for Graph-Based Handwriting Recognition
- Graph-Based Representations in Pattern Recognition
- Structural, Syntactic, and Statistical Pattern Recognition
This page was built for publication: Approximation of graph edit distance based on Hausdorff matching