A Quadratic Programming Approach to the Graph Edit Distance Problem

DOI10.1007/978-3-540-72903-7_9zbMath1182.68151OpenAlexW1839955272MaRDI QIDQ5325721

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_9

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

The graph matching problem ⋮ Median graphs: A genetic approach based on new theoretical properties

This page was built for publication: A Quadratic Programming Approach to the Graph Edit Distance Problem