Generating Multiset Permutations in Constant Time
From MaRDI portal
Publication:4373006
DOI10.1006/jagm.1997.0889zbMath0886.68071OpenAlexW1996058051MaRDI QIDQ4373006
Seymour Lipschutz, James F. Korsh
Publication date: 27 January 1998
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1997.0889
Related Items
A loopless algorithm for generating the permutations of a multiset, Constant time generation of derangements, Combinatorial isomorphism between Fibonacci classes, Binary bubble languages and cool-lex order, Loop-free Gray code algorithms for the set of compositions, From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns, Loopless Algorithms And SchrÖder Trees, Gray codes, loopless algorithm and partitions, The coolest way to generate combinations, Generating Gray codes for weak orders in constant amortized time, FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION