Name
Abstract | ||
|---|---|---|
It is pointed out that the problem of efficiently embedding a k-ary tree into hypercube with kor=3 has largely remained unsolved, even though optimal embeddings (i.e. embeddings achieving minimum delta , lambda , and in ) of complete and incomplete binary trees into hypercubes have been known for some time. Thus, in their quest for designing efficient embeddings of k-ary trees into hypercube for arbitrary k, the authors present some preliminary results that give efficient embeddings for the situations when k=3, 2/sup p/, 3/sup p/, 2/sup p/*3/sup q/ and p, q0. The embedding of complete ternary trees and the embedding of complete k-ary trees are considered. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1109/SPDP.1992.242739 | Arlington, TX |
Keywords | Field | DocType |
boolean functions,embedded computing,binary trees,k ary tree,tree graphs,computer science,hypercubes,binary tree,parallel processing | Boolean function,Combinatorics,Embedding,Tree (graph theory),Computer science,K-ary tree,Parallel computing,Binary tree,Ternary operation,Theoretical computer science,Hypercube,Lambda | Conference |
ISBN | Citations | PageRank |
0-8186-3200-3 | 2 | 0.38 |
References | Authors | |
6 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ajay K. Gupta | 1 | 166 | 24.40 |
| Hong Wang | 2 | 398 | 138.00 |