Now showing items 1-1 of 1

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

      Blumenthal DB; Gamper J (IEEE Computer Society, 2017)
      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 ...