A binary tree representation and related algorithms for generating integer partitions

DOI10.1093/comjnl/23.4.332zbMath0447.05007OpenAlexW2118930010MaRDI 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

zbMATH Keywords

binary treerepresentationlexicographic orderingpartitions of an integerrecursive traversal algorithm

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (6)

Efficient enumeration of ordered trees with \(k\) leaves ⋮ A loopless algorithm for generating binary tree sequences ⋮ Distribution of distinguishable objects to bins: generating all distributions ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ Generating all distributions of objects to bins ⋮ Fast algorithms for genegrating integer partitions

This page was built for publication: A binary tree representation and related algorithms for generating integer partitions