A binary tree representation and related algorithms for generating integer partitions

DOI10.1093/COMJNL/23.4.332MaRDI QIDQ3892254zbMATH OpenOpenAlexFDO

Authors Georghios Loizou, T. 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 treelexicographic orderingpartitions of an integerrecursive traversal algorithmrepresentation

Mathematics Subject Classification ID

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

Cited in

(7)

• 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
• Efficient enumeration of ordered trees with \(k\) leaves
• Distribution of distinguishable objects to bins: generating all distributions
• Trees with flowers: a catalog of integer partition and integer composition trees with their asymptotic analysis

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

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