Generation of Permutations by Adjacent Transposition
From MaRDI portal
Publication:5721208
DOI10.2307/2003846zbMath0114.01203OpenAlexW4250554859MaRDI QIDQ5721208
Publication date: 1963
Full work available at URL: https://doi.org/10.2307/2003846
Related Items (50)
The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations ⋮ Hamilton-connected derangement graphs on \(S_ n\) ⋮ Generating linear extensions of posets by transpositions ⋮ Generating indecomposable permutations ⋮ A multi-stack method for the fast generation of permutations with minimal length increasing subsequences ⋮ Efficient Computation of Middle Levels Gray Codes ⋮ Off-line algorithms for the list update problem ⋮ Finding parity difference by involutions ⋮ Solution of placement and routing problems in telephone exchange unit designs ⋮ Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph ⋮ The use and usefulness of numeration systems ⋮ A loop-free algorithm for generating the linear extensions of a poset ⋮ Cool-lex order and \(k\)-ary Catalan structures ⋮ Star transposition Gray codes for multiset permutations ⋮ Celebrating Loday's associahedron ⋮ A tight upper bound on the length of maximal bordered box repetition-free words ⋮ Restricted compositions and permutations: from old to new Gray codes ⋮ Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality ⋮ Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions ⋮ Generating the Nine-Point Graphs ⋮ The poset of bipartitions ⋮ Prefix partitioned Gray codes for particular cross-bifix-free sets ⋮ Loop-free Gray code algorithms for the set of compositions ⋮ A simplified loop-free algorithm for generating permutations ⋮ Sorting permutations with transpositions in \(O(n^3)\) amortized time ⋮ Diameter bounds and recursive properties of Full-Flag Johnson graphs ⋮ Shorthand universal cycles for permutations ⋮ Generating restricted classes of involutions, Bell and Stirling permutations ⋮ On the generation of permutations ⋮ Universal cycles of classes of restricted words ⋮ Optimization of generalized mean square error in signal processing and communication ⋮ More restrictive Gray codes for some classes of pattern avoiding permutations ⋮ Disjoint Hamilton cycles in the star graph ⋮ Gray codes for signed involutions ⋮ A general exhaustive generation algorithm for Gray structures ⋮ Rainbow Cycles in Flip Graphs ⋮ Combinatorial Algorithms for Listing Paths in Minimal Change Order ⋮ Gray code enumeration of families of integer partitions ⋮ Combinatorial generation via permutation languages. II. Lattice congruences ⋮ Unnamed Item ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Gray codes for reflection groups ⋮ Universal Systems of Oblivious Mobile Robots ⋮ Gray codes, loopless algorithm and partitions ⋮ Rainbow Cycles in Flip Graphs. ⋮ Strings from linear recurrences and permutations: a gray code ⋮ A new algorithm for generation of permutations ⋮ New classes of interconnection topology structures and their properties ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ Transposition generation of alternating permutations
Cites Work
This page was built for publication: Generation of Permutations by Adjacent Transposition
