Séminaire Lotharingien de Combinatoire, B10c (1984), 1 p.
[Formerly: Publ. I.R.M.A. Strasbourg, 1984, 244/S-110, p.
98.]
Heinz Lüneburg
Rekursive Erzeugung aller k-gliedrigen Partitionen einer
endlichen Menge
Abstract.
We present a recursive algorithm for generating all
of the k-element} partitions of an n-set}.
The methods which we
use here are similar to those used
in our previous paper
[Abh. Math. Sem. Univ. Hamburg 53 (1983), 134-145].
The following version is available:
The following version is available:
The paper has been finally published under the same title in
Mitt. Math. Sem. Giessen 166 (1984), 141-165.