Skip to Main content Skip to Navigation

Relationships between Graph Edit Distance and Maximal Common Unlabeled Subgraph

Abstract : Graph edit distance measures the distance between two graphs as the number of elementary operations (vertex/edge insertion, deletion, substitution) required to transform the first graph into the second one. Such a distance allows to define a metric between graphs and has many applications in the structural pattern recognition framework. However, the complexity of the computation of this distance is exponential in the size of both graphs to be compared. In this technical report, we focus our attention on applications where families of graphs to be considered have a finite set of structures. We then investigate under which relationships between the costs of the different elementary operations, such a priori knowledge may be used to pre compute most of the optimal edit path between any two graphs.
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download
Contributor : Benoit Gaüzère Connect in order to contact the contributor
Submitted on : Wednesday, August 29, 2012 - 5:20:43 PM
Last modification on : Saturday, June 25, 2022 - 9:46:57 AM
Long-term archiving on: : Friday, November 30, 2012 - 3:36:43 AM


Files produced by the author(s)


  • HAL Id : hal-00714879, version 4


Luc Brun, Benoit Gaüzère, Sébastien Fourey. Relationships between Graph Edit Distance and Maximal Common Unlabeled Subgraph. 2012. ⟨hal-00714879v4⟩



Record views


Files downloads