A. Sanfeliu and K. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE Transactions on Systems, Man, and Cybernetics, vol.13, issue.3, pp.353-363, 1983.
DOI : 10.1109/TSMC.1983.6313167

H. Bunke and G. Allermann, Inexact graph matching for structural pattern recognition, Pattern Recognition Letters, vol.1, issue.4, pp.245-253, 1983.
DOI : 10.1016/0167-8655(83)90033-8

H. Bunke, On a relation between graph edit distance and maximum common subgraph, Pattern Recognition Letters, vol.18, issue.8, pp.689-694, 1997.
DOI : 10.1016/S0167-8655(97)00060-3

K. Riesen and H. Bunke, Approximate graph edit distance computation by means of bipartite graph matching, Image and Vision Computing, vol.27, issue.7, pp.950-959, 2009.
DOI : 10.1016/j.imavis.2008.04.004

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955.
DOI : 10.1002/nav.3800020109

J. Munkres, Algorithms for the Assignment and Transportation Problems, Journal of the Society for Industrial and Applied Mathematics, vol.5, issue.1, pp.32-38, 1957.
DOI : 10.1137/0105003

R. Hammack, W. Imrich, and S. Klav?ar, Hanbook of Product Graphs, 2011.

K. Riesen, S. Emmenegger, and H. Bunke, A Novel Software Toolkit for Graph Edit Distance Computation, pp.142-151, 2013.
DOI : 10.1007/978-3-642-38221-5_15