Embedding of k-ary complete trees into hypercubes with optimal load

Embedding ofk-ary Complete Trees into Hypercubes with Uniform Load

“…See [11] for details. If k is a power of two, then the balanced embedding of CT k, h into hypercube Q n has the optimal load and optimal dilation min(n, log k).…”

“…Section 6 discusses the results. Proofs are shortened or omitted and the reader is referred to [11] for a full version text.…”