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
Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees with a given number of...
There are algorithms for generating combinatorial objects such as combinations, permutations and wel...
Abstract. We design an algorithm that generates multiset permutations in O(1) time from permutation ...
AbstractRepresentation of permutations and combinations of N elements in lexicographical order by el...
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 ...
AbstractA new algorithm for generating all ordered trees on n nodes, is developed. It is a nonrecurs...
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. ...
AbstractAn efficient algorithm is developed to generate all partitions of a set of elements into sub...
AbstractThis paper deals with the determination of subsets of permutations, which satisfy certain co...
AbstractThe so-called in-order of the vertices of a binary tree T, as used in the data structure lit...
A general reasoning based on the lexicographic order is studied. It helps to create algorithms for g...
We consider producing permutations and combinations in lexicographical order. Except for the array t...
An isomorphism between stack permutations of a set of n elements and ordered binary trees with n ver...
Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees with a given number of...
There are algorithms for generating combinatorial objects such as combinations, permutations and wel...
Abstract. We design an algorithm that generates multiset permutations in O(1) time from permutation ...
AbstractRepresentation of permutations and combinations of N elements in lexicographical order by el...
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 ...
AbstractA new algorithm for generating all ordered trees on n nodes, is developed. It is a nonrecurs...
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. ...
AbstractAn efficient algorithm is developed to generate all partitions of a set of elements into sub...
AbstractThis paper deals with the determination of subsets of permutations, which satisfy certain co...
AbstractThe so-called in-order of the vertices of a binary tree T, as used in the data structure lit...
A general reasoning based on the lexicographic order is studied. It helps to create algorithms for g...
We consider producing permutations and combinations in lexicographical order. Except for the array t...
An isomorphism between stack permutations of a set of n elements and ordered binary trees with n ver...
Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees with a given number of...
There are algorithms for generating combinatorial objects such as combinations, permutations and wel...
Abstract. We design an algorithm that generates multiset permutations in O(1) time from permutation ...
DOI
Add to ORKG