Tree identification is the problem of determining whether two trees are isomorphic, and it is a fundamental problem with a variety of interesting applications in diverse scientific and engineering disciplines. The related problems of subtree isomorphism and maximum common subtree isomorphism generalize pattern matching in strings to trees, and find application whenever hierarchical structures, structures described by trees, need to be compared.
CITATION STYLE
Valiente, G. (2002). Tree Isomorphism. In Algorithms on Trees and Graphs (pp. 151–251). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-04921-1_4
Mendeley helps you to discover research relevant for your work.