Geodesic
Rekursive Erzeugung aller k-gliedrigen Partitionen einer endlichen Menge
Séminaire lotharingien de combinatoire, Tome 10 (1984)

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

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 paper has been finally published under the same title in Mitt. Math. Sem. Giessen 166 (1984), 141-165. 

@article{SLC_1984_10_a2,
     author = {Heinz L\"uneburg},
     title = {Rekursive {Erzeugung} aller k-gliedrigen {Partitionen} einer endlichen {Menge}},
     journal = {S\'eminaire lotharingien de combinatoire},
     publisher = {mathdoc},
     volume = {10},
     year = {1984},
     url = {http://geodesic.mathdoc.fr/item/SLC_1984_10_a2/}
}
TY  - JOUR
AU  - Heinz Lüneburg
TI  - Rekursive Erzeugung aller k-gliedrigen Partitionen einer endlichen Menge
JO  - Séminaire lotharingien de combinatoire
PY  - 1984
VL  - 10
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SLC_1984_10_a2/
ID  - SLC_1984_10_a2
ER  - 
%0 Journal Article
%A Heinz Lüneburg
%T Rekursive Erzeugung aller k-gliedrigen Partitionen einer endlichen Menge
%J Séminaire lotharingien de combinatoire
%D 1984
%V 10
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SLC_1984_10_a2/
%F SLC_1984_10_a2
Heinz Lüneburg. Rekursive Erzeugung aller k-gliedrigen Partitionen einer endlichen Menge. Séminaire lotharingien de combinatoire, Tome 10 (1984). http://geodesic.mathdoc.fr/item/SLC_1984_10_a2/