Now showing items 1-1 of 1

    • Quasimetric graph edit distance as a compact quadratic assignment problem 

      Blumenthal DB; Daller D; Bougleux S; Brun L; Gamper J (IEEE, 2018)
      The graph edit distance (GED) is a widely used distance measure for attributed graphs. It has recently been shown that the problem of computing GED, which is a NP-hard optimization problem, can be formulated as a quadratic ...