Abstract
An account is given of algorithms for constructing partitions of an integer into a specified number of parts (with or without the requirement that the parts be distinct). The allowed parts may form a segment or a more general prescribed set of integers. Two ALGOL procedures are given, and some computational results are discussed.
Zusammenfassung
Es werden Algorithmen beschrieben zur Konstruktion der Partitionen einer ganzen Zahl in eine vorgeschriebene Anzahl von (verschiedenen oder nicht notwendig verschiedenen) Teilen. Die zugelassenen Teile können aus einem ganzzahligen Intervall oder einer allgemeineren Menge von ganzen Zahlen gewählt werden. Zwei ALGOL-Prozeduren werden angegeben, und einige Resultate diskutiert.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Berge, C.: Principles of Combinatorics. Academic Press 1971.
James, K. R., Riha, W.: Algorithm for Generating Graphs of a Given Partition. Computing16, 153–161 (1976).
James, K. R., Riha, W.: The Production of Trees and Rooted Trees of Order ≤15, Classified According to Partition. Report No. 47, Centre for computer Studies, University of Leeds, 1974.
McKay, J. K. S.: Algorithm 263, Partition Generator. Comm. of the ACM8 (1965).
White, J. S.: Algorithm 374, Restricted Partition Generator. Comm. of the ACM13 (1970).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Riha, W., James, K.R. Algorithm 29 efficient algorithms for doubly and multiply restricted partitions. Computing 16, 163–168 (1976). https://doi.org/10.1007/BF02241987
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02241987