1. Graph embedding through random walk for shortest paths problems;Berchenko,2009
2. Brun, L., Conte, D., Foggia, P., Vento, M., Villemin, D., 2010. Symbolic learning vs. graph kernels: An experimental comparison in a chemical application. In: Proceedings of the 14th Conference on Advances in Databases and Information Systems (ADBIS 2010), pp. 31–40.
3. An eigenspace projection clustering method for inexact graph matching;Caelli;IEEE Trans. Pattern Anal. Machine Intell.,2004
4. On the analytic forms called trees, with applications to the theory of chemical combinations;Cayley;Rep. British Assoc. Adv. Sci.,1875
5. Use of a neural network to determine the boiling point of alkanes;Cherqaoui;J. Chem. Soc. Faraday Trans.,1994