High Performance Computing and Grid in Asia Pacific Region, International Conference on (1997)
Apr. 28, 1997 to May 2, 1997
Vincent Vajnovszki , Universite de Bourgogne
Chris Phillips , University of Newcastle
The only published algorithms for generating k-ary trees in parallel are those of Akl and Stojmenovic (1996) and Vajnovszki and Phillips (1997). 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 memorymultiprocessor. In this paper we present a parallel generating algorithm for k-ary trees represented by P--sequences for execution on a linear array multicomputer.
parallel algorithms, P--sequences, combinatorial objects, k-ary trees
Vincent Vajnovszki, Chris Phillips, "Parallel Generation of k-ary Trees", High Performance Computing and Grid in Asia Pacific Region, International Conference on, vol. 00, no. , pp. 117, 1997, doi:10.1109/HPC.1997.592133