Fast algorithms for genegrating integer partitions
From MaRDI portal
Publication:4236115
DOI10.1080/00207169808804755zbMath0918.68040OpenAlexW2121241385WikidataQ105583939 ScholiaQ105583939MaRDI QIDQ4236115
Ivan Stojmenović, Antoine Zoghbi
Publication date: 22 March 1999
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169808804755
Related Items
On the enumeration of the set of saturated numerical semigroups with fixed Frobenius number. ⋮ Efficient numerical differentiation of implicitly-defined curves for sparse systems ⋮ Distribution of N-glycosylation sequons in proteins: how apart are they? ⋮ Synthesis of test sequences with a given switching activity ⋮ On the exhaustive generation of plane partitions ⋮ Efficient enumeration of ordered trees with \(k\) leaves ⋮ Optimal integer partitions ⋮ Independence tests for continuous random variables based on the longest increasing subsequence ⋮ Finding a short and accurate decision rule in disjunctive normal form by exhaustive search ⋮ A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions ⋮ On the parameterized complexity of vertex cover and edge cover with connectivity constraints ⋮ Insufficiency of chemical network model integration using a high-order Taylor series method ⋮ The complexity of Euler's integer partition theorem ⋮ Distribution of distinguishable objects to bins: generating all distributions ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ The integer nucleolus of directed simple games: a characterization and an algorithm ⋮ Generating all distributions of objects to bins ⋮ The Perimeter of Proper Polycubes ⋮ On sampling representatives of relational schemas with a functional dependency
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Listing and counting subtrees of equal size of a binary tree
- An analysis of two related loop-free algorithms for generating integer partitions
- A loopless algorithm for generating binary tree sequences
- A method and two algorithms on the theory of partitions
- Efficient algorithms for doubly and multiply restricted partitions
- Algorithm for generating graphs of a given partition
- On generating B-trees with constant average delay and in lexicographic order
- An algorithm for generating partitions and its applications
- Principles of combinatorics
- Gray code sequences of partitions
- Tree Traversal Related Algorithms for Generating Integer Partitions
- A binary tree representation and related algorithms for generating integer partitions
- Constant Time Generation of Rooted Trees
- Partition of Integers
- Ranking and Listing Algorithms for k-Ary Trees
- Generating Trees and Other Combinatorial Objects Lexicographically
- Ranking and unranking of B-trees
