Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
From MaRDI portal
Publication:5683694
DOI10.1145/321765.321781zbMath0266.68018OpenAlexW2109410667WikidataQ64116755 ScholiaQ64116755MaRDI QIDQ5683694
Publication date: 1973
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321765.321781
Related Items (64)
Partial duality for ribbon graphs. III: A gray code algorithm for enumeration ⋮ Generating combinations in parallel ⋮ Loopless Gray code enumeration and the Tower of Bucharest ⋮ Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations ⋮ A loopless algorithm for generating the permutations of a multiset ⋮ A multi-stack method for the fast generation of permutations with minimal length increasing subsequences ⋮ A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ Inside the binary reflected gray code: flip-swap languages in 2-gray code order ⋮ Speeding Up the Search Algorithm for the Best Differential and Best Linear Trails ⋮ Loop Free Generation ofK-Ary Trees ⋮ Constant time generation of derangements ⋮ A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words ⋮ A loop-free algorithm for generating the linear extensions of a poset ⋮ In Search for Good Chebyshev Lattices ⋮ Automatic tool for searching for differential characteristics in ARX ciphers and applications ⋮ Counting and computing the Rand and block distances of pairs of set partitions ⋮ Cool-lex order and \(k\)-ary Catalan structures ⋮ Flip-swap languages in binary reflected Gray code order ⋮ Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ Properties of the cycles that contain all vectors of weight \(\le k\) ⋮ Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ Trimming and gluing Gray codes ⋮ Gray codes in graphs of subsets ⋮ Combinatorial generation via permutation languages. III: Rectangulations ⋮ Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions ⋮ Unnamed Item ⋮ On the central levels problem ⋮ Efficient computation of statistical procedures based on all subsets of a specified size ⋮ Order-preserving representations of the partitions on the finite set ⋮ Enumerating \(k\)-arc-connected orientations ⋮ Binary bubble languages and cool-lex order ⋮ Dominating set is fixed parameter tractable in claw-free graphs ⋮ Combinatorial Gray codes for classes of pattern avoiding permutations ⋮ A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions ⋮ Loop-free Gray code algorithms for the set of compositions ⋮ A loopless approach for constructing a fastest algorithm for the towers of hanoi problem ⋮ A simplified loop-free algorithm for generating permutations ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ A loopless algorithm for generating binary tree sequences ⋮ Generating permutations with given ups and downs ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity ⋮ Accelerated algorithm for pattern detection in logical analysis of data ⋮ Gray codes for reflectable languages ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ A new algorithm for generating derangements ⋮ Syntactic view of sigma-tau generation of permutations ⋮ Unnamed Item ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Loopless Algorithms And SchrÖder Trees ⋮ Gray codes for non-crossing partitions and dissections of a convex polygon ⋮ Gray codes for reflection groups ⋮ Gray codes, loopless algorithm and partitions ⋮ A low spatial complexity algorithm to generate combinations with the strong minimal change property ⋮ The coolest way to generate combinations ⋮ Variable-length codes independent or closed with respect to edit relations ⋮ Loop-free algorithms for traversing binary trees ⋮ A new algorithm for generation of permutations ⋮ Gray cycles of maximum length related to \(k\)-character substitutions ⋮ FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION ⋮ A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously ⋮ Gray codes from antimatroids
This page was built for publication: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
