Nordic Journal of Computing Bibliography

S. G. Akl and I. Stojmenovic. Generating t-ary Trees in Parallel. Nordic Journal of Computing, 3(1):63-71, Spring 1996.
Abstract

We present a cost-optimal parallel algorithm for generating t-ary trees. Using a known inversion table representation, our algorithm generates all tree sequences in lexicographic order. It uses a linear array of n processors (where n is the number of nodes in the tree), each having a constant number of registers (each storing an integer of size at most tn), and each being responsible for producing one element of a given tree sequence.

Categories and Subject Descriptors: G.1.0 [Numerical Analysis]; G.2.1 [Discrete Mathematics]: Combinatorics; G.2.2 [Discrete Mathematics]: Graph Theory

Additional Key Words and Phrases: binary tree, t-ary tree, parallel algorithms, breadth first search, linear array of processors, parallel random access machine, lexicographic order

Selected papers that cite this one

Selected references


Shortcuts:

  • Nordic Journal of Computing homepage
  • Bibliography top level
  • Nordic Journal of Computing Author Index
  • Search the HBP database