Search

This paper presents new algorithms for generating all n-node t-ary trees in linked representation which take constant average time per tree. They use fewer memory references and are considerably faster than previous such algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a new algorithm for the generation of all n node t-ary trees in linked representation. It also gives two constant average time implementations of the algorithm. The first directly generates the next tree from its predecessor while the second retains additional information about the predecessor and is faster for t > 4. [ABSTRACT FROM PUBLISHER]

This paper presents a loopless algorithm to generate all permutations of a multiset. Each is obtained from its predecessor by making one transposition. It differs from previous such algorithms by using an array for the permutations but requiring storage only linear in its length. [ABSTRACT FROM AUTHOR]

Presents loopless algorithms for directly generating Schroder tree representations. Features of the algorithms; Generation of k-compositions of n in inverse lexicographic order using the loopless algorithms.

An ordered tree with specified degrees and $n$ nodes has $a_{i}$ nodes of degree $i$ where $a_{0} = 1+\sum _{i = 1,h}(i-1)a_{i}$ and $n = \sum_{i = 0,h}a_{i}$. This paper presents a new and simpler loopless algorithm for generating all ordered trees with specified degrees. When $a_{k} = N$, $a_{0} = (k-1)N+1$ and all other $a_{i}$'s are 0, then all $N$ node $k$-ary trees are generated. [ABSTRACT FROM PUBLISHER]