Rekursive Erzeugung aller Partitionen einer endlichen Menge

DOI10.1007/BF02941315MaRDI QIDQ1059080zbMATH OpenFDO

Authors Heinz Lüneburg

Publication date 1983

Published in Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

zbMATH Keywords

partitionsGray coderecursive generation

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Combinatorial aspects of partitions of integers (05A17)

Recommendations

• scientific article; zbMATH DE number 3902661
• Recursive generation of all \(k\)-element partitions of a finite set
• Kombinatorik mit dem Computer: Partitionen und Frankaturen. (Combinatorics with the computer: partitions and the postage stamp problem)
• scientific article; zbMATH DE number 5812481
• scientific article; zbMATH DE number 3860390

Cites work

• scientific article; zbMATH DE number 3748431 (Why is no real title available?)
• A Gray code for set partitions
• Gray-Codes

Cited in

(4)

• Recursive generation of all \(k\)-element partitions of a finite set
• scientific article; zbMATH DE number 3902661 (Why is no real title available?)
• scientific article; zbMATH DE number 3050408 (Why is no real title available?)
• A Fast Algorithm for Generating Set Partitions

This page was built for publication: Rekursive Erzeugung aller Partitionen einer endlichen Menge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1059080)