Correcting and Speeding-Up Bounds for Non-Uniform Graph Edit Distance


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… (More)
DOI: 10.1109/ICDE.2017.57

2 Figures and Tables


  • Presentations referencing similar topics