Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: interconnection network

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Embedding complete ternary trees into hypercubes

100%

Choudum S., Lavanya S.

Discussiones Mathematicae Graph Theory

2008

tom 28

nr 3

463-476

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Choudum S.

1 Lavanya S.

1 2008

Wyniki wyszukiwania

Embedding complete ternary trees into hypercubes