The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Consideramos o problema de incorporar árvores binárias completas em toros bidimensionais com congestionamento mínimo (borda). Sabe-se que para um número inteiro positivo n, Um 2nA árvore binária completa de -1 vértice pode ser incorporada em um (2
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Akira MATSUBAYASHI, Ryo TAKASU, "Minimum Congestion Embedding of Complete Binary Trees into Tori" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 9, pp. 1804-1808, September 2000, doi: .
Abstract: We consider the problem of embedding complete binary trees into 2-dimensional tori with minimum (edge) congestion. It is known that for a positive integer n, a 2n-1-vertex complete binary tree can be embedded in a (2
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_9_1804/_p
Copiar
@ARTICLE{e83-a_9_1804,
author={Akira MATSUBAYASHI, Ryo TAKASU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Minimum Congestion Embedding of Complete Binary Trees into Tori},
year={2000},
volume={E83-A},
number={9},
pages={1804-1808},
abstract={We consider the problem of embedding complete binary trees into 2-dimensional tori with minimum (edge) congestion. It is known that for a positive integer n, a 2n-1-vertex complete binary tree can be embedded in a (2
keywords={},
doi={},
ISSN={},
month={September},}
Copiar
TY - JOUR
TI - Minimum Congestion Embedding of Complete Binary Trees into Tori
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1804
EP - 1808
AU - Akira MATSUBAYASHI
AU - Ryo TAKASU
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2000
AB - We consider the problem of embedding complete binary trees into 2-dimensional tori with minimum (edge) congestion. It is known that for a positive integer n, a 2n-1-vertex complete binary tree can be embedded in a (2
ER -