Generating Trees With N Nodes and M Leaves. Pallo, J. International Journal of Computer Mathematics, 21(2):133--144, Taylor \& Francis, January, 1987.
Generating Trees With N Nodes and M Leaves [link]Paper  doi  abstract   bibtex   
A coding of binary trees, introduced in a previous paper [4], is generalized to regular k-ary trees. This coding is used in order to generate all the trees with n nodes and m leaves as a list, by embedding them in a set of regular m-ary trees.
@article{ Pallo1987,
  abstract = {A coding of binary trees, introduced in a previous paper [4], is generalized to regular k-ary trees. This coding is used in order to generate all the trees with n nodes and m leaves as a list, by embedding them in a set of regular m-ary trees.},
  author = {Pallo, J.},
  doi = {10.1080/00207168708803562},
  issn = {0020-7160},
  journal = {International Journal of Computer Mathematics},
  month = {January},
  number = {2},
  pages = {133--144},
  publisher = {Taylor \& Francis},
  title = {{Generating Trees With N Nodes and M Leaves}},
  url = {http://dx.doi.org/10.1080/00207168708803562},
  volume = {21},
  year = {1987}
}

Downloads: 0