1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Reading (1974)
2. Azaïs, R., Cerutti, G., Gemmerlé, D., Ingels, F.: Treex: a Python package for manipulating rooted trees. J. Open Source Softw. 4(38), 1351 (2019)
3. Azaïs, R., Ingels, F.: The weight function in the subtree kernel is decisive. J. Mach. Learn. Res. 21, 1–36 (2020)
4. Booth, K.S., Colbourn, C.J.: Problems polynomially equivalent to graph isomorphism. University, Computer Science Department (1979)
5. Canzar, S., Elbassioni, K., Klau, G.W., Mestre, J.: On tree-constrained matchings and generalizations. Algorithmica 71(1), 98–119 (2015)