Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching

DOI10.1007/978-3-642-20844-7_11zbMath1381.05068OpenAlexW1605556478MaRDI QIDQ3003453

Kaspar Riesen, Stefan Fankhauser, Horst Bunke

Publication date: 27 May 2011

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-642-20844-7_11

Mathematics Subject Classification ID

Applications of graph theory (05C90) Pattern recognition, speech recognition (68T10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Exact Computation of Graph Edit Distance for Uniform and Non-uniform Metric Edit Costs ⋮ Fast similarity search for graphs by edit distance ⋮ Approximation of graph edit distance based on Hausdorff matching ⋮ Treelet kernel incorporating cyclic, stereo and inter pattern information in chemoinformatics ⋮ The graph matching problem ⋮ Deep graph similarity learning: a survey

This page was built for publication: Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching