Correcting and Speeding-Up Bounds for Non-Uniform Graph Edit Distance
MetadataShow full item record
SubjectEdge labels; Lower and upper bounds; Undirected graph; Edit distance; Experimental evaluation
The problem of deriving lower and upper bounds for the edit distance between labelled undirected graphs has recently received increasing attention. However, only one algorithm has been proposed that allegedly computes not only an upper but also a lower bound for non-uniform metric edit costs and incorporates information about both node and edge labels. In this paper, we show that this algorithm is incorrect in the sense that, in general, it does not compute a lower bound. We present BRANCH, a corrected version of the algorithm that runs in O(n5) time. We also develop a speed-up BRANCHFAST that runs in O(n4) time and computes a lower bound, which is only slightly less accurate than the one computed by BRANCH. An experimental evaluation shows that BRANCH and BRANCHFAST yield excellent runtime/accuracy-tradeoffs, as they outperform all existing competitors in terms of runtime or in terms of accuracy.
Showing items related by title, author, creator and subject.
Blumenthal DB; Gamper J (2018)The problem of deriving lower and upper bounds for the edit distance between undirected, labeled graphs has recently received increasing attention. However, only one algorithm has been proposed that allegedly computes not ...
Blumenthal DB; Gamper J (Springer, 2017)The graph edit distance is a well-established and widely used distance measure for labelled, undirected graphs. However, since its exact computation is NP -hard, research has mainly focused on devising approximative ...
Blumenthal DB; Bougleux S; Gamper J; Brun L (Springer, 2018)The graph edit distance (GED) is a flexible graph dissimilarity measure widely used within the structural pattern recognition field. A widely used paradigm for approximating GED is to define local structures rooted at the ...