Pages that link to "Item:Q5721208"
From MaRDI portal
The following pages link to Generation of Permutations by Adjacent Transposition (Q5721208):
Displaying 49 items.
- A multi-stack method for the fast generation of permutations with minimal length increasing subsequences (Q294635) (← links)
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- The poset of bipartitions (Q648983) (← links)
- Loop-free Gray code algorithms for the set of compositions (Q655198) (← links)
- Universal cycles of classes of restricted words (Q712255) (← links)
- Gray codes for signed involutions (Q724881) (← links)
- A new algorithm for generation of permutations (Q795511) (← links)
- Transposition generation of alternating permutations (Q807622) (← links)
- Generating restricted classes of involutions, Bell and Stirling permutations (Q966165) (← links)
- More restrictive Gray codes for some classes of pattern avoiding permutations (Q989488) (← links)
- Disjoint Hamilton cycles in the star graph (Q990094) (← links)
- A general exhaustive generation algorithm for Gray structures (Q995753) (← links)
- Gray codes, loopless algorithm and partitions (Q1040787) (← links)
- Solution of placement and routing problems in telephone exchange unit designs (Q1109671) (← links)
- The use and usefulness of numeration systems (Q1119959) (← links)
- On the generation of permutations (Q1218264) (← links)
- Hamilton-connected derangement graphs on \(S_ n\) (Q1336702) (← links)
- Off-line algorithms for the list update problem (Q1350929) (← links)
- Finding parity difference by involutions (Q1356534) (← links)
- Sorting permutations with transpositions in \(O(n^3)\) amortized time (Q1731847) (← links)
- Diameter bounds and recursive properties of Full-Flag Johnson graphs (Q1752664) (← links)
- Shorthand universal cycles for permutations (Q1759661) (← links)
- Gray code enumeration of families of integer partitions (Q1805052) (← links)
- Gray codes for reflection groups (Q1825283) (← links)
- A loop-free algorithm for generating the linear extensions of a poset (Q1917670) (← links)
- Cool-lex order and \(k\)-ary Catalan structures (Q1932373) (← links)
- Restricted compositions and permutations: from old to new Gray codes (Q1944104) (← links)
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (Q1944946) (← links)
- Combinatorial generation via permutation languages. II. Lattice congruences (Q2055278) (← links)
- Strings from linear recurrences and permutations: a gray code (Q2089698) (← links)
- A constant-time algorithm for middle levels Gray codes (Q2309469) (← links)
- The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations (Q2364644) (← links)
- Generating linear extensions of posets by transpositions (Q2368024) (← links)
- Generating indecomposable permutations (Q2368923) (← links)
- Optimization of generalized mean square error in signal processing and communication (Q2496652) (← links)
- Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph (Q2656353) (← links)
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality (Q2689255) (← links)
- Universal Systems of Oblivious Mobile Robots (Q2835029) (← links)
- Efficient Computation of Middle Levels Gray Codes (Q3452851) (← links)
- A simplified loop-free algorithm for generating permutations (Q4078041) (← links)
- New classes of interconnection topology structures and their properties (Q4229546) (← links)
- (Q4318151) (← links)
- Generating the Nine-Point Graphs (Q4777329) (← links)
- Rainbow Cycles in Flip Graphs. (Q5115806) (← links)
- Rainbow Cycles in Flip Graphs (Q5208641) (← links)
- Combinatorial Algorithms for Listing Paths in Minimal Change Order (Q5458510) (← links)
- Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
- Star transposition Gray codes for multiset permutations (Q6074576) (← links)
- Celebrating Loday's associahedron (Q6139351) (← links)
