We present a new approach to compute the graph edit distance between two attributed graphs which is based on a formal connection between the graph edit distance problem and that of finding a dominant set in an auxiliary edge-weighted 'association' graph. Experiments performed on various data sets show that with the proposed approach we are able to improve on state-of-the-art algorithms. © 2012 ICPR Org Committee.
Computing the Graph Edit Distance Using Dominant Sets
REBAGLIATI, NICOLA;PELILLO, Marcello;
2012-01-01
Abstract
We present a new approach to compute the graph edit distance between two attributed graphs which is based on a formal connection between the graph edit distance problem and that of finding a dominant set in an auxiliary edge-weighted 'association' graph. Experiments performed on various data sets show that with the proposed approach we are able to improve on state-of-the-art algorithms. © 2012 ICPR Org Committee.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
ICPR 2012 GED and DS.pdf
non disponibili
Tipologia:
Documento in Post-print
Licenza:
Accesso chiuso-personale
Dimensione
183.1 kB
Formato
Adobe PDF
|
183.1 kB | Adobe PDF | Visualizza/Apri |
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
