A Fast Algorithm for Generating Set Partitions

DOI10.1093/COMJNL/31.3.283MaRDI QIDQ3792259zbMATH OpenOpenAlexFDO

Authors M. C. Er

Publication date 1988

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/31.3.283

zbMATH Keywords

average time complexitypartition generation finite sortsrecursive algorithm

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Combinatorial aspects of partitions of integers (05A17) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• scientific article; zbMATH DE number 3860390
• Fast algorithms for genegrating integer partitions
• Recursive generation of all k-element partitions of a finite set
• Rekursive Erzeugung aller Partitionen einer endlichen Menge
• Parallel Processing and Applied Mathematics

Cited in

(23)

• Dynamic structural symmetry breaking for constraint satisfaction problems
• Fast algorithm for generating ascending compositions
• An algorithm for partitioning a set into simple parts
• Algorithmic counting of zero-dimensional finite topological spaces with respect to the covering dimension
• All-integer column generation for set partitioning: basic principles and extensions
• scientific article; zbMATH DE number 5812481 (Why is no real title available?)
• scientific article; zbMATH DE number 3860390 (Why is no real title available?)
• An efficient algorithm for a special case of the set partition problem
• Complementary set partitions
• Fast algorithms for genegrating integer partitions
• Numbering of set partitions
• Simple constant amortized time generation of fixed length numeric partitions
• A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL
• An algorithm for constructing all supercharacter theories of a finite group
• Distribution of distinguishable objects to bins: generating all distributions
• Parallel Processing and Applied Mathematics
• Graph-Theoretic Concepts in Computer Science
• Recursive generation of all k-element partitions of a finite set
• On the average time complexity of computation with random partition
• Towards a complete classification of holographic entropy inequalities
• A note on the complexity of a partition algorithm
• Fixed-parameter tractability of anonymizing data by suppressing entries
• An optimal algorithm for generating equivalence relations on a linear array of processors

This page was built for publication: A Fast Algorithm for Generating Set Partitions

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