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 条

[1] Embedding complete binary trees into star and pancake graphs
Bouabdallah, A.
Heydemann, M.C.
Opatrny, J.
Sotteau, D.
Theory of Computing Systems, 31 (03): : 279 - 305
[2] Embedding complete binary trees into star and pancake graphs
Bouabdallah, A
Heydemann, MC
Opatrny, J
Sotteau, D
THEORY OF COMPUTING SYSTEMS, 1998, 31 (03) : 279 - 305
[3] Embedding complete binary trees in product graphs
Broadwater, A
Efe, K
Fernandez, A
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1997, 1197 : 56 - 66
[4] Embedding complete binary trees in product graphs
Efe, K
Broadwater, AL
Fernandez, A
TELECOMMUNICATION SYSTEMS, 2000, 13 (01) : 99 - 109
[5] Embedding complete binary trees in product graphs
Kemal Efe
Adrienne L. Broadwater
Antonio Fernandez
Telecommunication Systems, 2000, 13 : 99 - 109
[6] Embedding of congestion-free complete binary trees with dilation two in star graphs
Chen, YS
Tseng, YC
Juang, TY
Chang, CJ
ICA(3)PP 97 - 1997 3RD INTERNATIONAL CONFERENCE ON ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, 1997, : 331 - 344
[7] Congestion-free, dilation-2 embedding of complete binary trees into star graphs
Tseng, YC
Chen, YS
Juang, TY
Chang, CJ
NETWORKS, 1999, 33 (03) : 221 - 231
[8] On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
Fang, WC
Hsu, CC
INFORMATION SCIENCES, 2000, 126 (1-4) : 191 - 204
[9] EMBEDDING GRAPHS IN BINARY-TREES
SHERLEKAR, DD
JAJA, J
COMPUTING AND INFORMATION, 1989, : 111 - 115
[10] THE COMPLEXITY OF EMBEDDING GRAPHS INTO BINARY-TREES
MONIEN, B
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 300 - 309

← 1 2 3 4 5 →