AbstractRepresentation of permutations and combinations of N elements in lexicographical order by elements of a tree are considered. An algorithm for generating the nodes is presented and some examples are given. The algorithm could be implemented in any programming language that allows for recursive calls
We consider producing permutations and combinations in lexicographical order. Except for the array t...
AbstractThe so-called in-order of the vertices of a binary tree T, as used in the data structure lit...
AbstractA new algorithm for generating all ordered trees on n nodes, is developed. It is a nonrecurs...
AbstractRepresentation of permutations and combinations of N elements in lexicographical order by el...
AbstractAn efficient algorithm is developed to generate all partitions of a set of elements into sub...
AbstractPermutations and combinations of n objects as well as the elements of the dihedral group of ...
AbstractPermutations and combinations of n objects as well as the elements of the dihedral group of ...
A thesis submitted to the Faculty d£ Science of the University of the Witwatersfand in fulfillment ...
AbstractIn this paper, we study the permutation representation of k-ary trees. First, we extend the ...
Abstract. The shapes of binary trees can be encoded as permutations having a very special property. ...
AbstractA Cayley permutation (C-permutation for short) of length n is a permutation p of n elements ...
AbstractIn this paper, we study the permutation representation of k-ary trees. First, we extend the ...
AbstractThe so-called in-order of the vertices of a binary tree T, as used in the data structure lit...
AbstractThis paper deals with the determination of subsets of permutations, which satisfy certain co...
AbstractWe show a one-one correspondence between all the regular binary trees with n internal nodes ...
We consider producing permutations and combinations in lexicographical order. Except for the array t...
AbstractThe so-called in-order of the vertices of a binary tree T, as used in the data structure lit...
AbstractA new algorithm for generating all ordered trees on n nodes, is developed. It is a nonrecurs...
AbstractRepresentation of permutations and combinations of N elements in lexicographical order by el...
AbstractAn efficient algorithm is developed to generate all partitions of a set of elements into sub...
AbstractPermutations and combinations of n objects as well as the elements of the dihedral group of ...
AbstractPermutations and combinations of n objects as well as the elements of the dihedral group of ...
A thesis submitted to the Faculty d£ Science of the University of the Witwatersfand in fulfillment ...
AbstractIn this paper, we study the permutation representation of k-ary trees. First, we extend the ...
Abstract. The shapes of binary trees can be encoded as permutations having a very special property. ...
AbstractA Cayley permutation (C-permutation for short) of length n is a permutation p of n elements ...
AbstractIn this paper, we study the permutation representation of k-ary trees. First, we extend the ...
AbstractThe so-called in-order of the vertices of a binary tree T, as used in the data structure lit...
AbstractThis paper deals with the determination of subsets of permutations, which satisfy certain co...
AbstractWe show a one-one correspondence between all the regular binary trees with n internal nodes ...
We consider producing permutations and combinations in lexicographical order. Except for the array t...
AbstractThe so-called in-order of the vertices of a binary tree T, as used in the data structure lit...
AbstractA new algorithm for generating all ordered trees on n nodes, is developed. It is a nonrecurs...
DOI
Add to ORKG