Parallel generation of k-ary trees

The only published algorithms for generating k-ary trees in parallel are those of Akl and Stojmenovic [7] and Vajnovszki and Phillips [16]. In the first of these papers trees are represented by an inversion table and the processor model is a linear array multicomputer. In the second trees are represented by bitstrings and the algorithm executes on a shared memory multiprocessor In this paper we present a parallel generating algorithm for k-ary trees represented by P-sequences for execution an a linear array multicomputer.