NII Technical Reports
National Institute of Informatics
| Title | Efficient Generation of Rooted Trees |
| Authors | Shin-ichi Nakano, Takeaki Uno |
| Abstract | 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. |
| Language | English |
| Published | Jul 3, 2003 |
| Pages | 9p |
| PDF File | 03-005E.pdf |