Y. Berchenko and M. Teicher, Graph embedding through random walk for shortest paths problems, Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications. SAGA'09, pp.127-140, 2009.

L. Brun, D. Conte, P. Foggia, M. Vento, and D. Villemin, Symbolic learning vs. graph kernels: An experimental comparison in a chemical application, Proceedings of the 14th Conference on Advances in Databases and Information Systems, pp.31-40, 2010.

T. Caelli and S. Kosinov, An eigenspace projection clustering method for inexact graph matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, pp.515-519, 2004.

A. Cayley, On the analytic forms called trees, with applications to the theory of chemical combinations, Reports British Assoc. Adv. Sci, vol.9, pp.427-460, 1875.

D. Cherqaoui and D. Villemin, Use of a neural network to determine the boiling point of alkanes, J. Chem. Soc. Faraday Trans, vol.90, pp.97-102, 1994.

D. Cherqaoui, D. Villemin, A. Mesbah, J. M. Cense, and V. Kvasnicka, Use of a Neural Network to Determine the Normal Boiling Points of Acyclic Ethers, Peroxides, Acetals and their Sulfur Analogues, J. Chem. Soc. Faraday Trans, vol.90, pp.2015-2019, 1994.

F. Chung, Spectral graph theory, 1997.

H. Elghawalby and E. R. Hancock, Graph characteristic from the gaussbonnet theorem, Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition. SSPR & SPR '08, pp.207-216, 2008.

H. Elghawalby, E. R. Hancock, E. R. Hancock, R. R. Martin, and M. A. Sabin, Geometric characterizations of graphs using heat kernel embeddings, IMA Conference on the Mathematics of Surfaces, pp.124-142, 2009.

D. Emms, R. C. Wilson, and E. Hancock, Graph embedding using quantum commute times, 6th IAPR-TC15 International Workshop GbRPR 2007. IAPR TC15, pp.371-382, 2007.
DOI : 10.1007/978-3-540-72903-7_34

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.

F. Fouss, L. Yen, A. Pirotte, and M. Saerens, An experimental investigation of graph kernels on a collaborative recommendation task, Sixth International Conference on Data Mining, pp.863-868, 2006.

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

B. Luo, R. C. Wilson, and E. R. Hancock, A spectral approach to learning structural variations in graphs, Pattern Recognition, vol.39, issue.6, pp.1188-1198, 2006.

P. Mahé and J. Vert, Graph kernels based on tree patterns for molecules, Machine Learning, vol.75, issue.1, pp.3-35, 2008.

H. L. Morgan, The generation of a unique machine description for chemical structures-a technique developed at chemical abstracts service, J. of Chem. Doc, vol.5, issue.2, pp.107-113, 1965.

M. Neuhaus and H. Bunke, Bridging the gap between graph edit distance and kernel machines, 2007.

C. S. Ong, X. Mary, S. Canu, and A. J. Smola, Learning with nonpositive kernels, Proceedings of the twenty-first international conference on Machine learning. ICML '04, pp.639-646, 2004.

R. Otter, The number of trees, The Annals of Mathematics, vol.49, issue.3, pp.583-599, 1948.

G. Poezevara, B. Cuissart, and B. Crémilleux, Discovering emerging graph patterns from chemicals, Proceedings of the 18th International Symposium on Methodologies for Intelligent Systems, pp.45-55, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01011298

J. Ramon and T. Gärtner, Expressivity versus efficiency of graph kernels, 1st Int. Workshop on Mining Graphs, Trees and Sequences, pp.65-74, 2003.

K. Riesen and H. Bunke, Iam graph database repository for graph based pattern recognition and machine learning, Proceedings of the, 2008.

K. Riesen, M. Neuhaus, and H. Bunke, Graph embedding in vector spaces by means of prototype selection, 6th IAPR-TC15 International Workshop GbRPR 2007. IAPR TC15, pp.383-393, 2007.

N. Shervashidze, S. V. Vishwanathan, T. H. Petri, K. Mehlhorn, and K. M. Borgwardt, Efficient graphlet kernels for large graph comparison, 12th International Conference on Artificial Intelligence and Statistics (AISTATS), pp.488-495, 2009.

A. Smola and R. Kondor, Kernels and regularization on graphs, Learning Theory and Kernel Machines, 2003.
DOI : 10.1007/978-3-540-45167-9_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.7020

F. Steinke and B. Schölkopf, Kernels, regularization and differential equations, Pattern Recognition, vol.41, pp.3271-3286, 2008.
DOI : 10.1016/j.patcog.2008.06.011
URL : http://hdl.handle.net/11858/00-001M-0000-0013-C657-4

F. Suard, A. Rakotomamonjy, and A. Bensrhair, Kernel on bag of paths for measuring similarity of shapes, European Symposium on Artificial Neural Networks, pp.355-360, 2002.