An algorithm for generating subsets of fixed size with a strong minimal change property (Q1060849): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(84)90091-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2089687380 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient generation of the binary reflected gray code and its applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3692887 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Hamilton Paths and a Minimal Change Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5672651 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three new combination algorithms with the minimal change property / rank | |||
Normal rank |
Latest revision as of 18:23, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for generating subsets of fixed size with a strong minimal change property |
scientific article |
Statements
An algorithm for generating subsets of fixed size with a strong minimal change property (English)
0 references
1984
0 references
We present an algorithm for generating a list \(S_ 1,S_ 2,...,S_ m\) \((m=\left( \begin{matrix} n\\ k\end{matrix} \right))\) of all subsets of size k of a set of size n. The algorithm has two important properties: it is a minimal change algorithm in that successive subsets \(S_ i\) and \(S_{i+1}\) are minimally different, and it is fast in the sense that the time required to produce the list is bounded by a constant multiple of \(\left( \begin{matrix} n\\ k\end{matrix} \right)\).
0 references
combinatorial algorithm
0 references
Hamilton path
0 references
minimal change algorithm
0 references