Name
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. |
Year | Venue | Keywords |
|---|---|---|
2012 | Pattern Recognition | graph theory,set theory,attributed graphs,auxiliary edge-weighted association graph,data sets,dominant sets,formal connection,graph edit distance problem |
Field | DocType | ISSN |
Graph operations,Strength of a graph,Line graph,Pattern recognition,Graph property,Computer science,Null graph,Artificial intelligence,Distance-regular graph,Butterfly graph,Graph (abstract data type) | Conference | 1051-4651 |
ISBN | Citations | PageRank |
978-1-4673-2216-4 | 9 | 0.47 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicola Rebagliati | 1 | 9 | 0.47 |
| Albert Solé-Ribalta | 2 | 9 | 0.47 |
| Marcello Pelillo | 3 | 1888 | 150.33 |
| Francesc Serratosa | 4 | 56 | 2.12 |