Adjacent interchange generation of combinations
From MaRDI portal
Publication:5203008
DOI10.1016/0196-6774(88)90036-3zbMath0726.05003OpenAlexW2091923122MaRDI QIDQ5203008
Publication date: 1988
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(88)90036-3
Permutations, words, matrices (05A05) Combinatorial codes (94B25) Eulerian and Hamiltonian graphs (05C45)
Related Items (22)
On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains ⋮ Generating linear extensions of posets by transpositions ⋮ Efficient Computation of Middle Levels Gray Codes ⋮ A generalized permutahedron ⋮ A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words ⋮ On a Combinatorial Generation Problem of Knuth ⋮ 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 ⋮ The coolest way to generate binary strings ⋮ A simple systolic algorithm for generating combinations in lexicographic order ⋮ An optimal parallel algorithm for generating combinations ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Rainbow Cycles in Flip Graphs ⋮ Gray code enumeration of families of integer partitions ⋮ Unnamed Item ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Gray codes, loopless algorithm and partitions ⋮ Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Rainbow Cycles in Flip Graphs. ⋮ Transposition generation of alternating permutations
This page was built for publication: Adjacent interchange generation of combinations
