返回Google圖書搜尋

Generating Binary Trees in Parallel

出版	Queen's University, Department of Computing & Information Science, 1992
URL	http://books.google.com.hk/books?id=b7PCtgAACAAJ&hl=&source=gbs_api

註釋Abstract: "We present two cost-optimal parallel algorithms for generating binary trees. Using a known inversion table representation, and a new breadth first search (BFS) parent array encoding of trees as integer sequences, our first 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 constant size memory and each being responsible for producing one node of a given tree. The algorithm can be extended to produce parent-children relations among nodes of trees, as part of the output, in constant delay per tree. If the new BFS encoding is used, then the address of the parent of each node is known directly as part of the representation