An algorithm for generating subsets of fixed size with a strong minimal change property

DOI10.1016/0020-0190(84)90091-7zbMath0569.68054OpenAlexW2089687380MaRDI QIDQ1060849

Peter Eades, Brendan D. McKay

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90091-7

zbMATH Keywords

Hamilton pathcombinatorial algorithmminimal change algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Paths and cycles (05C38) Discrete mathematics in relation to computer science (68R99)

Related Items (22)

A loopless algorithm for generating the permutations of a multiset ⋮ An Eades-McKay algorithm for well-formed parentheses strings ⋮ Efficient Computation of Middle Levels Gray Codes ⋮ Constant time generation of derangements ⋮ A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words ⋮ On a Combinatorial Generation Problem of Knuth ⋮ Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ Star transposition Gray codes for multiset permutations ⋮ Trimming and gluing Gray codes ⋮ Efficient computation of statistical procedures based on all subsets of a specified size ⋮ Unranking of small combinations from large sets ⋮ The coolest way to generate binary strings ⋮ On the low Hamming weight discrete logarithm problem for nonadjacent representations ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Hamiltonian paths for involutions in the square of a Cayley graph ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Gray code for derangements ⋮ A low spatial complexity algorithm to generate combinations with the strong minimal change property ⋮ The coolest way to generate combinations ⋮ Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences ⋮ Gray cycles of maximum length related to \(k\)-character substitutions ⋮ FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION

Cites Work

• Some Hamilton Paths and a Minimal Change Algorithm
• Three new combination algorithms with the minimal change property
• Efficient generation of the binary reflected gray code and its applications
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for generating subsets of fixed size with a strong minimal change property