Algorithm generates rooted trees efficiently, indicating a clear relation among tree structures.
In this paper we give an algorithm to generate all rooted trees with at most n vertices. The algorithm generates each tree in constant time on average. Furthermore the algorithm is simple, and clarifies a simple relation among the trees, that is a family tree of trees, and outputs trees based on the relation.
No takes yet. Share an insight, caveat, or question.
Nakano et al. (2003) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: