Tree Traversal Related Algorithms for Generating Integer Partitions

DOI10.1137/0212036MaRDI QIDQ3670600zbMATH OpenOpenAlexFDO

Authors Georghios Loizou, T. I. Fenner

Publication date 1983

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0212036

zbMATH Keywords

asymptotic analysisbinary tree traversal ordersinteger partitionsloop-free algorithms

Mathematics Subject Classification ID

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

Cited in

(2)

• Fast algorithms for genegrating integer partitions
• Trees with flowers: a catalog of integer partition and integer composition trees with their asymptotic analysis

This page was built for publication: Tree Traversal 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 Q3670600)