L. Brun, B. Gaüzére, and S. Fourey, Relationships between graph edit distance and maximal common unlabeled subgraph, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00714879

H. Bunke, Error correcting graph matching: on the influence of the underlying cost function, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.21, issue.9, pp.917-922, 1999.
DOI : 10.1109/34.790431

S. Fankhauser, K. Riesen, and H. Bunke, Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching, Graph-Based Representations in Pattern Recognition, pp.102-111, 2011.
DOI : 10.1007/978-3-642-20844-7_11

B. Gaüzère, L. Brun, and D. Villemin, Two new graph kernels and applications to chemoinformatics, Pattern Recognition Lett, p.2012

D. Haussler, Convolution kernels on discrete structures, 1999.

H. Kashima, K. Tsuda, and A. Inokuchi, Kernels for graphs, pp.155-170, 2004.

P. Mahé and J. Vert, Graph kernels based on tree patterns for molecules, Machine Learning, pp.3-35, 2008.
DOI : 10.1007/s10994-008-5086-2

M. Neuhaus and H. Bunke, Bridging the gap between graph edit distance and kernel machines, 2007.
DOI : 10.1142/6523

K. Zhang, R. Statman, and D. Shasha, On the editing distance between unordered labeled trees, Information Processing Letters, vol.42, issue.3, pp.133-139, 1992.
DOI : 10.1016/0020-0190(92)90136-J