Bipartite Graph Matching for Computing the Edit Distance of Graphs

DOI10.1007/978-3-540-72903-7_1zbMath1182.68205OpenAlexW1485714115MaRDI QIDQ5325713

Michel Neuhaus, Kaspar Riesen, 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

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

Related Items (8)

Development and analysis of a sentence semantics representation model ⋮ Fast similarity search for graphs by edit distance ⋮ A local branching heuristic for solving a graph edit distance problem ⋮ Structure-based graph distance measures of high degree of precision ⋮ Spectral graph features for the classification of graphs and graph sequences ⋮ Median graphs: A genetic approach based on new theoretical properties ⋮ A Recursive Embedding Approach to Median Graph Computation ⋮ Improving Graph Classification by Isomap

This page was built for publication: Bipartite Graph Matching for Computing the Edit Distance of Graphs