Abstract
Given an ordered tree T, an ordering is defined on the set of subtrees of T. Algorithms are presented for listing all subtrees in that order, and for determining the tree occupying a given position in the list. The second algorithm runs in time proportional to the number of vertices in the tree. An explicit formula is given for the total number of subtrees summed over all trees T.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
