Abstract
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.
The method for tree identification seems not to offer much help toward a good algorithm for deciding whether one given rooted tree contains a subgraph identical to another given rooted tree so that roots identify. It would be very interesting to have a good algorithm for this more general identification task.
—Robert G. Busacker and Thomas L. Saaty [63]
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Valiente, G. (2002). Tree Isomorphism. In: Algorithms on Trees and Graphs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04921-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-04921-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07809-5
Online ISBN: 978-3-662-04921-1
eBook Packages: Springer Book Archive