Embedding of hypercubes into sibling trees

被引：5

作者：

Arockiaraj, Micheal ^{[1
]}

Quadras, Jasintha ^{[2
]}

Rajasingh, Indra ^{[3
]}

Shalini, Arul Jeya ^{[2
]}

机构：

[1] Loyola Coll, Dept Math, Madras 600034, Tamil Nadu, India

[2] Stella Maris Coll, Dept Math, Madras 600086, Tamil Nadu, India

[3] VIT Univ, Sch Adv Sci, Madras 600127, Tamil Nadu, India

来源：

DISCRETE APPLIED MATHEMATICS | 2014年 / 169卷

关键词：

Hypercubes; Embedding; Congestion; Wirelength; Sibling trees; WIRELENGTH; MESHES;

D O I：

10.1016/j.dam.2014.01.002

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The aim of this paper is to generalize the Congestion Lemma, which has been considered an efficient tool to compute the minimum wirelength (Manuel et al., 2009) and thereby obtain the minimum wirelength of embedding hypercubes into sibling trees. (C) 2014 Elsevier B.V. All rights reserved.

引用

页码：9 / 14

页数：6

共 50 条

[21] Optimal embedding of large complete binary trees into hypercubes
Chen, C.C.
Chen, R.J.
Journal of Information Science and Engineering, 1996, 12 (02):
[22] On fault-tolerant embedding complete binary trees into hypercubes
Chen, YW
Chung, KL
COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 1998, 13 (02): : 97 - 100
[23] An optimal embedding of incomplete binary trees onto incomplete hypercubes
Huang, CH
Hsiao, JY
Lee, RCT
Fang, JF
FOURTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS (I-SPAN'99), PROCEEDINGS, 1999, : 80 - 85
[24] Embedding large complete binary trees in hypercubes with load balancing
Efe, K
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1996, 35 (01) : 104 - 109
[25] Embedding of k-ary complete trees into hypercubes with uniform load
Trdlicka, J
Tvrdik, P
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1998, 52 (02) : 120 - 131
[26] Embedding of k-ary complete trees into hypercubes with optimal load
Trdlicka, J
Tvrdik, P
EIGHTH IEEE SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1996, : 600 - 607
[27] FAULT-TOLERANT EMBEDDING OF COMPLETE BINARY-TREES IN HYPERCUBES
CHAN, MY
LEE, SJ
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1993, 4 (03) : 277 - 288
[28] Embedding certain height-balanced trees and complete p(m)-ary trees into hypercubes
Raman, Indhumathi
Choudum, S. A.
JOURNAL OF DISCRETE ALGORITHMS, 2013, 22 : 53 - 65
[29] Embedding complete bipartite graph into sibling trees with optimum wirelength
Greeni, A. Berin
Journal of Combinatorial Mathematics and Combinatorial Computing, 2020, 112 : 115 - 125
[30] FAULT-TOLERANT EMBEDDING MULTIPLE COMPLETE BINARY-TREES INTO HYPERCUBES
CHUNG, KL
CHEN, YW
COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 1995, 10 (03): : 187 - 191

← 1 2 3 4 5 →