Abstract
An algorithm of T. Beyer and S. M. Hedetniemi for generating rooted unlabeled trees is extended to generate unlabeled free trees. All the nonisomorphic trees of a given size are generated, without repetition, in time proportional to the number of trees.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 540-548 |
| Number of pages | 9 |
| Journal | SIAM Journal on Computing |
| Volume | 15 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1986 |