- Tytuł:
- Embedding complete ternary trees into hypercubes
- Autorzy:
-
Choudum, S.
Lavanya, S. - Powiązania:
- https://bibliotekanauki.pl/articles/743075.pdf
- Data publikacji:
- 2008
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
complete ternary trees
hypercube
interconnection network
embedding
dilation
node congestion
edge congestion - Opis:
- We inductively describe an embedding of a complete ternary tree Tₕ of height h into a hypercube Q of dimension at most ⎡(1.6)h⎤+1 with load 1, dilation 2, node congestion 2 and edge congestion 2. This is an improvement over the known embedding of Tₕ into Q. And it is very close to a conjectured embedding of Havel [3] which states that there exists an embedding of Tₕ into its optimal hypercube with load 1 and dilation 2. The optimal hypercube has dimension ⎡(log₂3)h⎤ ( = ⎡(1.585)h⎤) or ⎡(log₂3)h⎤+1.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2008, 28, 3; 463-476
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł