Embedding Complete Binary Trees into Star and Pancake Graphs

被引：0

作者：

A. Bouabdallah

M. C. Heydemann

J. Opatrny

D. Sotteau

机构：

[1] LRI,

[2] UA 410 CNRS,undefined

[3] bât 490,undefined

[4] Université de Paris-Sud,undefined

[5] 91405 Orsay,undefined

[6] France ,undefined

[7] LIVE,undefined

[8] Université d'Evry-Val-d'Essonne,undefined

[9] Bld. des Coquibus,undefined

[10] 91025 Evry,undefined

[11] France ,undefined

[12] Department of Computer Sciences,undefined

[13] Concordia University,undefined

[14] Montréal,undefined

[15] Canada,undefined

来源：

Theory of Computing Systems | 1998年 / 31卷

关键词：

Maximum Distance; Binary Tree; Undirected Graph; Injective Mapping; Great Height;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Let G and H be two simple undirected graphs. An embedding of the graph G into the graph H is an injective mapping f from the vertices of G to the vertices of H . The dilation of the embedding is the maximum distance between f(u),f(v) taken over all edges (u,v) of G .

引用

页码：279 / 305

页数：26

共 50 条

[41] Reconfiguration of complete binary trees in full IEH graphs and faulty hypercubes
Lin, JC
Keh, HC
INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS, 2001, 15 (01): : 47 - 55
[42] On embedding binary trees into hypercubes
Tayu, S
Ueno, S
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 2000, 83 (01): : 1 - 13
[43] DENSE EDGE-DISJOINT EMBEDDING OF COMPLETE BINARY-TREES IN THE HYPERCUBE
RAVINDRAN, S
GIBBONS, A
INFORMATION PROCESSING LETTERS, 1993, 45 (06) : 321 - 325
[44] FAULT-TOLERANT EMBEDDING MULTIPLE COMPLETE BINARY-TREES INTO HYPERCUBES
CHUNG, KL
CHEN, YW
COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 1995, 10 (03): : 187 - 191
[45] Fault-tolerant embedding of complete binary trees in locally twisted cubes
Liu, Zhao
Fan, Jianxi
Zhou, Jingya
Cheng, Baolei
Jia, Xiaohua
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2017, 101 : 69 - 78
[46] Dense edge-disjoint embedding of complete binary trees in interconnection networks
Ravindran, S
Gibbons, AM
Paterson, MS
THEORETICAL COMPUTER SCIENCE, 2000, 249 (02) : 325 - 342
[47] Embedding complete trees into the hypercube
Bezrukov, SL
DISCRETE APPLIED MATHEMATICS, 2001, 110 (2-3) : 101 - 119
[48] Embedding Hamiltonian paths and Hamiltonian cycles in faulty pancake graphs
Hung, CN
Liang, KY
Hsu, LH
I-SPAN'02: INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS, 2002, : 179 - 184
[49] On embedding complete graphs into hypercubes
Klugerman, M
Russell, A
Sundaram, R
DISCRETE MATHEMATICS, 1998, 186 (1-3) : 289 - 293
[50] Embedding of complete graphs in broken Chimera graphs
Elisabeth Lobe
Lukas Schürmann
Tobias Stollenwerk
Quantum Information Processing, 2021, 20

← 1 2 3 4 5 →