AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
Given a certain Gray code consisting of 2n codewords, it is possible to generate from it n! 2n codes...
For any integer $n\geq 1$ a \emph{middle levels Gray code} is a cyclic listing of all bitstrings of ...
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., p...
AbstractWe give the first Gray code for the set of n-length permutations with a given number of cycl...
AbstractWe give the first Gray code for the set of n-length permutations with a given number of cycl...
AbstractAn indecomposable permutation π on [n] is one such that π([m])=[m] for no m<n. We consider i...
In this work we present a general and versatile algorithmic framework for exhaustively generating a ...
In this work we present a general and versatile algorithmic framework for exhaustively generating a ...
We consider the algorithmic problem of generating each subset of [n]:={1,2,...,n} whose size is in s...
AbstractThe past decade has seen a flurry of research into pattern avoiding permutations but little ...
For any integer~$n\geq 1$, a \emph{middle levels Gray code} is a cyclic listing of all $n$-element a...
AbstractMany combinatorial structures can be constructed from simpler components. For example, a per...
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
Given a certain Gray code consisting of 2n codewords, it is possible to generate from it n! 2n codes...
For any integer $n\geq 1$ a \emph{middle levels Gray code} is a cyclic listing of all bitstrings of ...
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., p...
AbstractWe give the first Gray code for the set of n-length permutations with a given number of cycl...
AbstractWe give the first Gray code for the set of n-length permutations with a given number of cycl...
AbstractAn indecomposable permutation π on [n] is one such that π([m])=[m] for no m<n. We consider i...
In this work we present a general and versatile algorithmic framework for exhaustively generating a ...
In this work we present a general and versatile algorithmic framework for exhaustively generating a ...
We consider the algorithmic problem of generating each subset of [n]:={1,2,...,n} whose size is in s...
AbstractThe past decade has seen a flurry of research into pattern avoiding permutations but little ...
For any integer~$n\geq 1$, a \emph{middle levels Gray code} is a cyclic listing of all $n$-element a...
AbstractMany combinatorial structures can be constructed from simpler components. For example, a per...
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
Given a certain Gray code consisting of 2n codewords, it is possible to generate from it n! 2n codes...
For any integer $n\geq 1$ a \emph{middle levels Gray code} is a cyclic listing of all bitstrings of ...
DOI
Add to ORKG