Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes

Volker Heun, Ernst W. Mayr

Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

5 Zitate (Scopus)

Abstract

It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into a hypercube does not provide any hint on how this embedding can be extended if each leaf spawns two new leaves. In this paper, we present simple dynamic embeddings of double-rooted complete binary trees into hypercubes which do not suffer from this disadvantage. We also present edge-disjoint embeddings with optimal load and unit dilation. Furthermore, all these embeddings can be efficiently implemented on the hypercube itself such that the embedding of each new level of leaves can be computed in constant time. Because of the similarity, our results can be immediately transfered to complete binary trees.

OriginalspracheEnglisch
Seiten (von - bis)1110-1125
Seitenumfang16
FachzeitschriftJournal of Parallel and Distributed Computing
Jahrgang61
Ausgabenummer8
DOIs
PublikationsstatusVeröffentlicht - Aug. 2001

Fingerprint

Untersuchen Sie die Forschungsthemen von „Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren