Algorithms for generation of rooted tree on the base of total partition procedure
Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 99-101
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
Questions of generating root trees on the base of total partition procedure for compositions, weak compositions and partitions of a natural number are considered.
[1] Vilenkin N. Ya., Kombinatorika, Nauka, M., 1969 | MR | Zbl
[2] Stenli R., Perechislitelnaya kombinatorika. Derevya, proizvodyaschie funktsii i simmetricheskie funktsii, Mir, M., 2005 | MR
[3] Kruchinin V. V., Metody postroeniya algoritmov generatsii i numeratsii kombinatornykh ob'ektov na osnove derevev I/ILI, Izd-vo Spektr, Tomsk, 2007