Generation of Permutations by Adjacent Transposition
From MaRDI portal
Cites work
Cited in
(58)- Gray codes, loopless algorithm and partitions
- Solution of placement and routing problems in telephone exchange unit designs
- The use and usefulness of numeration systems
- On the generation of permutations
- Hamilton-connected derangement graphs on \(S_ n\)
- Off-line algorithms for the list update problem
- Finding parity difference by involutions
- 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
- Gray code enumeration of families of integer partitions
- Gray codes for reflection groups
- A loop-free algorithm for generating the linear extensions of a poset
- Cool-lex order and k-ary Catalan structures
- Restricted compositions and permutations: from old to new Gray codes
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
- Combinatorial generation via permutation languages. II. Lattice congruences
- Strings from linear recurrences and permutations: a gray code
- A constant-time algorithm for middle levels Gray codes
- The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations
- Generating linear extensions of posets by transpositions
- Generating indecomposable permutations
- Optimization of generalized mean square error in signal processing and communication
- Small cycles, generalized prisms and Hamiltonian cycles in the bubble-sort graph
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
- Universal systems of oblivious mobile robots
- A multi-stack method for the fast generation of permutations with minimal length increasing subsequences
- Efficient Computation of Middle Levels Gray Codes
- A simplified loop-free algorithm for generating permutations
- New classes of interconnection topology structures and their properties
- scientific article; zbMATH DE number 706769 (Why is no real title available?)
- Generating the Nine-Point Graphs
- Rainbow cycles in flip graphs
- Rainbow cycles in flip graphs
- Combinatorial Algorithms for Listing Paths in Minimal Change Order
- Combinatorial generation via permutation languages. I: Fundamentals
- 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
- The poset of bipartitions
- Generating signed permutations by twisting two-sided ribbons
- Loop-free Gray code algorithms for the set of compositions
- On the hardness of Gray code problems for combinatorial objects
- A lean additive frailty model: with an application to clustering of melanoma in Norwegian families
- Acyclic reorientation lattices and their lattice quotients
- On symmetric games with respect to a permutation group
- The minimum number of discriminant equations for a symmetric game
- Combinatorial generation via permutation languages. IV: Elimination trees
- Universal cycles of classes of restricted words
- Gray codes for signed involutions
- Combinatorial generation via permutation languages. VII: Supersolvable hyperplane arrangements
- Skipping ropes: an efficient gray code algorithm for generating wiggly permutations
- A new algorithm for generation of permutations
- Transposition generation of alternating permutations
- Generating restricted classes of involutions, Bell and Stirling permutations
- More restrictive Gray codes for some classes of pattern avoiding permutations
- Disjoint Hamilton cycles in the star graph
- A general exhaustive generation algorithm for Gray structures
This page was built for publication: Generation of Permutations by Adjacent Transposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5721208)
