Algorithms for generation of rooted tree on the base of total partition procedure
Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 99-101
Questions of generating root trees on the base of total partition procedure for compositions, weak compositions and partitions of a natural number are considered.
@article{PDM_2009_10_a51,
author = {V. V. Kruchinin},
title = {Algorithms for generation of rooted tree on the base of total partition procedure},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {99--101},
year = {2009},
number = {10},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2009_10_a51/}
}
V. V. Kruchinin. Algorithms for generation of rooted tree on the base of total partition procedure. Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 99-101. http://geodesic.mathdoc.fr/item/PDM_2009_10_a51/
[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