A Fast Algorithm for Generating Set Partitions
From MaRDI portal
Publication:3792259
DOI10.1093/comjnl/31.3.283zbMath0647.68071OpenAlexW2025969633MaRDI QIDQ3792259
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
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of partitions of integers (05A17) Discrete mathematics in relation to computer science (68R99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Fixed-parameter tractability of anonymizing data by suppressing entries ⋮ A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL ⋮ Algorithmic counting of zero-dimensional finite topological spaces with respect to the covering dimension ⋮ An optimal algorithm for generating equivalence relations on a linear array of processors ⋮ An algorithm for constructing all supercharacter theories of a finite group ⋮ Dynamic structural symmetry breaking for constraint satisfaction problems
This page was built for publication: A Fast Algorithm for Generating Set Partitions
