A binary tree representation and related algorithms for generating integer partitions
From MaRDI portal
Publication:3892254
DOI10.1093/comjnl/23.4.332zbMath0447.05007MaRDI QIDQ3892254
Georghios Loizou, Trevor I. Fenner
Publication date: 1980
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/23.4.332
binary tree; representation; lexicographic ordering; partitions of an integer; recursive traversal algorithm
05C05: Trees
05A17: Combinatorial aspects of partitions of integers
11P81: Elementary theory of partitions
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
Distribution of distinguishable objects to bins: generating all distributions, Efficient enumeration of ordered trees with \(k\) leaves, A loopless algorithm for generating binary tree sequences, Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract), Generating all distributions of objects to bins, Fast algorithms for genegrating integer partitions