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 条
12345