• Improving Hausdorff Edit Distance Using Structural Node Context 

      Fischer, Andreas; Uchida, Seiichi; Frinken, Volkmar; Riesen, Kaspar; Bunke, Horst (Springer, 2015)
      In order to cope with the exponential time complexity of graph edit distance, several polynomial-time approximation algorithms have been proposed in recent years. The Hausdorff edit distance is a quadratic-time matching ...