Bipartite Graph Matching for Computing the Edit Distance of Graphs

DOI10.1007/978-3-540-72903-7_1MaRDI QIDQ5325713zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Recommendations

• Speeding up graph edit distance computation through fast bipartite matching
• Improving bipartite graph edit distance approximation using various search strategies
• An edit distance between graph correspondences

Cited in

(22)

• scientific article; zbMATH DE number 2043363 (Why is no real title available?)
• Spectral graph features for the classification of graphs and graph sequences
• Efficient Suboptimal Graph Isomorphism
• On the influence of node centralities on graph edit distance for graph classification
• scientific article; zbMATH DE number 2043358 (Why is no real title available?)
• Median graphs: A genetic approach based on new theoretical properties
• Structural, Syntactic, and Statistical Pattern Recognition
• Speeding up graph edit distance computation through fast bipartite matching
• Improving Graph Classification by Isomap
• Fast similarity search for graphs by edit distance
• Approximation of graph edit distance in quadratic time
• Approximation of graph edit distance based on Hausdorff matching
• Improving bipartite graph edit distance approximation using various search strategies
• A Quadratic Programming Approach to the Graph Edit Distance Problem
• A fast matching algorithm for graph-based handwriting recognition
• Structure-based graph distance measures of high degree of precision
• Approximate matching of neighborhood subgraphs -- an ordered string graph Levenshtein method
• Development and analysis of a sentence semantics representation model
• A local branching heuristic for solving a graph edit distance problem
• scientific article; zbMATH DE number 2090203 (Why is no real title available?)
• A Recursive Embedding Approach to Median Graph Computation
• Weighted mean of a pair of graphs

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)