Bipartite Graph Matching for Computing the Edit Distance of Graphs
From MaRDI portal
Publication:5325713
DOI10.1007/978-3-540-72903-7_1zbMATH Open1182.68205OpenAlexW1485714115MaRDI QIDQ5325713FDOQ5325713
Authors: Kaspar Riesen, Michel Neuhaus, Horst Bunke 
Publication date: 24 July 2009
Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72903-7_1
Recommendations
Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)
Cited In (17)
- Structural, Syntactic, and Statistical Pattern Recognition
- Title not available (Why is that?)
- Improving Graph Classification by Isomap
- Structure-based graph distance measures of high degree of precision
- A local branching heuristic for solving a graph edit distance problem
- Title not available (Why is that?)
- Development and analysis of a sentence semantics representation model
- Efficient Suboptimal Graph Isomorphism
- Spectral graph features for the classification of graphs and graph sequences
- A Recursive Embedding Approach to Median Graph Computation
- Weighted mean of a pair of graphs
- Improving bipartite graph edit distance approximation using various search strategies
- Speeding up graph edit distance computation through fast bipartite matching
- Fast similarity search for graphs by edit distance
- A Quadratic Programming Approach to the Graph Edit Distance Problem
- Median graphs: A genetic approach based on new theoretical properties
- Title not available (Why is that?)
This page was built for publication: Bipartite Graph Matching for Computing the Edit Distance of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325713)
