1. Borgwardt, K.M., Kriegel, H.P.: Shortest-path kernels on graphs. In: Proceedings of the Fifth IEEE International Conference on Data Mining (ICDM 2005), pp. 74–81 (2005).
http://dx.doi.org/10.1109/ICDM.2005.132
2. Lecture Notes in Computer Science;M Cho,2010
3. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI 18(3), 265–298 (2004)
4. Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 18(4), 377–388 (1996)
5. Haussler, D.: Convolution kernels on discrete structures. Technical report UCS-CRL-99-10, University of California at Santa Cruz, Santa Cruz, CA, USA (1999).
http://citeseer.ist.psu.edu/haussler99convolution.html