Quasimetric Graph Edit Distance as a Compact Quadratic Assignment Problem - Normandie Université Access content directly
Conference Papers Year : 2018

Quasimetric Graph Edit Distance as a Compact Quadratic Assignment Problem

Distance d'édition entre graphes quasimétrique formulée comme un problème compact d'affectation quadratique.

Abstract

The graph edit distance (GED) is a widely used distance measure for attributed graphs. It has recently been shown that the problem of computing GED, which is a NP-hard optimization problem, can be formulated as a quadratic assignment problem (QAP). This formulation is useful, since it allows to derive well performing approximative heuristics for GED from existing techniques for QAP. In this paper, we focus on the case where the edit costs that underlie GED are quasimetric. This is the case in many applications of GED. We show that, for quasimetric edit costs, it is possible to reduce the size of the corresponding QAP formulation. An empirical evaluation shows that this reduction significantly speeds up the QAP-based approximative heuristics for GED.
Fichier principal
Vignette du fichier
metric-graph-edit-distance.pdf (279.65 Ko) Télécharger le fichier
Loading...

Dates and versions

hal-01865214 , version 1 (09-09-2018)

Identifiers

  • HAL Id : hal-01865214 , version 1

Cite

David Blumenthal, Évariste Daller, Sébastien Bougleux, Luc Brun, Johann Gamper. Quasimetric Graph Edit Distance as a Compact Quadratic Assignment Problem. 24th International Conference on Pattern Recognition (ICPR), Aug 2018, Pékin, China. ⟨hal-01865214⟩
56 View
206 Download

Share

Gmail Mastodon Facebook X LinkedIn More