Three new combination algorithms with the minimal change property
From MaRDI portal
Publication:3947143
DOI10.1145/358589.358612zbMath0486.68070MaRDI QIDQ3947143
Leonard H. Soicher, Clement Wing Hong Lam
Publication date: 1982
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/358589.358612
combinatorial algorithms; reverse lexicographical order; computations on discrete structures; loopless algorithms; loopless property
68Q25: Analysis of algorithms and problem complexity
68R99: Discrete mathematics in relation to computer science
Related Items
A low spatial complexity algorithm to generate combinations with the strong minimal change property, On the correct implementation of the Hanurav-Vijayan selection procedure for unequal probability sampling without replacement, An algorithm for generating subsets of fixed size with a strong minimal change property