Benutzer: Gast  Login
Titel:

Optimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees into Hypercubes

Dokumenttyp:
Technical Report
Autor(en):
Volker Heun
Abstract:
The double-rooted complete binary tree is a complete binary tree where the path (of length 2) between the children of the root is replaced by a path of length 3. 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 the hypercube does not provide any hint how this embedding can be extended if each leaf spawns two new leaves. In this paper,...     »
Stichworte:
parallel algorithm; network; simulation; dynamic embedding; hypercube; complete binary tree
Jahr:
1996
Jahr / Monat:
1996-01-24 00:00:00
Seiten/Umfang:
24
 BibTeX