AbstractAn efficient algorithm is developed to generate all partitions of a set of elements into subsets of specified sizes, in lexicographic order, and more generally to generate all permutations whose elements are arranged consistently with a partial ordering that has a tree structure
AbstractThere are many analogies between subsets and permutations of a set, and in particular betwee...
In this work we present a general and versatile algorithmic framework for exhaustively generating a ...
AbstractThe class SSn of stack sortable permutations is known to be in 1-1 correspondence with the s...
AbstractRepresentation of permutations and combinations of N elements in lexicographical order by el...
AbstractRepresentation of permutations and combinations of N elements in lexicographical order by el...
AbstractWe show a one-one correspondence between all the regular binary trees with n internal nodes ...
AbstractA parallel algorithm is presented for generating a permutation of size n. The algorithm uses...
A thesis submitted to the Faculty d£ Science of the University of the Witwatersfand in fulfillment ...
AbstractThis paper deals with the determination of subsets of permutations, which satisfy certain co...
AbstractGenerating trees represent a useful technique in the enumeration of various combinatorial ob...
AbstractA Cayley permutation (C-permutation for short) of length n is a permutation p of n elements ...
AbstractA new algorithm for generating all ordered trees on n nodes, is developed. It is a nonrecurs...
AbstractA technique for computing in permutation groups of high degree is developed. The technique u...
This paper presents a new algorithm for determining the order of a solvable permutationgroup from a ...
In this paper we discuss the problem of partitioning a permutation graph into cliques of bounded siz...
AbstractThere are many analogies between subsets and permutations of a set, and in particular betwee...
In this work we present a general and versatile algorithmic framework for exhaustively generating a ...
AbstractThe class SSn of stack sortable permutations is known to be in 1-1 correspondence with the s...
AbstractRepresentation of permutations and combinations of N elements in lexicographical order by el...
AbstractRepresentation of permutations and combinations of N elements in lexicographical order by el...
AbstractWe show a one-one correspondence between all the regular binary trees with n internal nodes ...
AbstractA parallel algorithm is presented for generating a permutation of size n. The algorithm uses...
A thesis submitted to the Faculty d£ Science of the University of the Witwatersfand in fulfillment ...
AbstractThis paper deals with the determination of subsets of permutations, which satisfy certain co...
AbstractGenerating trees represent a useful technique in the enumeration of various combinatorial ob...
AbstractA Cayley permutation (C-permutation for short) of length n is a permutation p of n elements ...
AbstractA new algorithm for generating all ordered trees on n nodes, is developed. It is a nonrecurs...
AbstractA technique for computing in permutation groups of high degree is developed. The technique u...
This paper presents a new algorithm for determining the order of a solvable permutationgroup from a ...
In this paper we discuss the problem of partitioning a permutation graph into cliques of bounded siz...
AbstractThere are many analogies between subsets and permutations of a set, and in particular betwee...
In this work we present a general and versatile algorithmic framework for exhaustively generating a ...
AbstractThe class SSn of stack sortable permutations is known to be in 1-1 correspondence with the s...
DOI
Add to ORKG