1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI/MIT Press (1996)
2. Akutsu, T.: A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 76(9), 1488–1493 (1993)
3. Chi, Y., Yang, Y., Muntz, R.R.: Indexing and mining free trees. In: ICDM, pp. 509–512. IEEE Computer Society (2003)
4. Cognitive Technologies;L Raedt De,2008
5. Diestel, R.: Graph Theory, vol. 173. Springer, Heidelberg (2012)