On the exact computation of the graph edit distance

This publication has 12 references indexed in Scilit:

• Graph edit distance as a quadratic assignment problem
  Pattern Recognition Letters, 2017
• A long trip in the charming world of graphs for Pattern Recognition
  Pattern Recognition, 2015
• A Hybrid Classification Model for Digital Pathology Using Structural and Statistical Pattern Recognition
  IEEE Transactions on Medical Imaging, 2012
• Approximate graph edit distance computation by means of bipartite graph matching
  Image and Vision Computing, 2009
• A survey of graph edit distance
  Pattern Analysis and Applications, 2009
• A binary linear programming formulation of the graph edit distance
  IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006
• Inexact graph matching for structural pattern recognition
  Pattern Recognition Letters, 1983
• A Formal Basis for the Heuristic Determination of Minimum Cost Paths
  IEEE Transactions on Systems Science and Cybernetics, 1968
• Algorithms for the Assignment and Transportation Problems
  Journal of the Society for Industrial and Applied Mathematics, 1957
• The Hungarian method for the assignment problem
  Naval Research Logistics Quarterly, 1955