Pages that link to "Item:Q5683694"

The following pages link to Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations (Q5683694):

Displayed 50 items.

• A multi-stack method for the fast generation of permutations with minimal length increasing subsequences (Q294635) ‎ (← links)
• A loopless algorithm for generating multiple binary tree sequences simultaneously (Q300220) ‎ (← links)
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) ‎ (← links)
• Binary bubble languages and cool-lex order (Q645969) ‎ (← links)
• Dominating set is fixed parameter tractable in claw-free graphs (Q650938) ‎ (← links)
• A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions (Q655178) ‎ (← links)
• Loop-free Gray code algorithms for the set of compositions (Q655198) ‎ (← links)
• Loop-free algorithms for traversing binary trees (Q786538) ‎ (← links)
• A new algorithm for generation of permutations (Q795511) ‎ (← links)
• Partial duality for ribbon graphs. III: A gray code algorithm for enumeration (Q825536) ‎ (← links)
• A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words (Q866549) ‎ (← links)
• Combinatorial Gray codes for classes of pattern avoiding permutations (Q924132) ‎ (← links)
• Gray codes for reflectable languages (Q976101) ‎ (← links)
• Gray codes for non-crossing partitions and dissections of a convex polygon (Q1028124) ‎ (← links)
• Gray codes, loopless algorithm and partitions (Q1040787) ‎ (← links)
• The coolest way to generate combinations (Q1044892) ‎ (← links)
• Generating combinations in parallel (Q1082084) ‎ (← links)
• Gray codes in graphs of subsets (Q1147162) ‎ (← links)
• Order-preserving representations of the partitions on the finite set (Q1159220) ‎ (← links)
• A loopless algorithm for generating binary tree sequences (Q1182098) ‎ (← links)
• Generating permutations with given ups and downs (Q1186163) ‎ (← links)
• Gray codes from antimatroids (Q1318347) ‎ (← links)
• Loopless Gray code enumeration and the Tower of Bucharest (Q1623270) ‎ (← links)
• Trimming and gluing Gray codes (Q1694730) ‎ (← links)
• Gray codes for reflection groups (Q1825283) ‎ (← links)
• A loopless algorithm for generating the permutations of a multiset (Q1885026) ‎ (← links)
• A loop-free algorithm for generating the linear extensions of a poset (Q1917670) ‎ (← links)
• Counting and computing the Rand and block distances of pairs of set partitions (Q1932369) ‎ (← links)
• Cool-lex order and \(k\)-ary Catalan structures (Q1932373) ‎ (← links)
• Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (Q1944946) ‎ (← links)
• Variable-length codes independent or closed with respect to edit relations (Q2084770) ‎ (← links)
• Gray cycles of maximum length related to \(k\)-character substitutions (Q2096591) ‎ (← links)
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order (Q2140470) ‎ (← links)
• Automatic tool for searching for differential characteristics in ARX ciphers and applications (Q2179383) ‎ (← links)
• Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle (Q2189829) ‎ (← links)
• Enumerating \(k\)-arc-connected orientations (Q2211357) ‎ (← links)
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) ‎ (← links)
• A constant-time algorithm for middle levels Gray codes (Q2309469) ‎ (← links)
• Constant time generation of derangements (Q2390248) ‎ (← links)
• Accelerated algorithm for pattern detection in logical analysis of data (Q2489651) ‎ (← links)
• Flip-swap languages in binary reflected Gray code order (Q2676472) ‎ (← links)
• Properties of the cycles that contain all vectors of weight \(\le k\) (Q2678985) ‎ (← links)
• On the central levels problem (Q2692785) ‎ (← links)
• A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously (Q2867132) ‎ (← links)
• Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order (Q2958342) ‎ (← links)
• FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION (Q3434277) ‎ (← links)
• Speeding Up the Search Algorithm for the Best Differential and Best Linear Trails (Q3454589) ‎ (← links)
• (Q3628894) ‎ (← links)
• A loopless approach for constructing a fastest algorithm for the towers of hanoi problem (Q3802653) ‎ (← links)
• A new algorithm for generating derangements (Q3870323) ‎ (← links)