Efficient Generation of Rooted Trees
Shin-ichi Nakano, Takeaki Uno · 2003
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.