| Identifier
|
771 |
|
ชื่อเรื่อง |
ONE BY ONE EMBEDDING THE CROSSED HYPERCUBE INTO PANCAKE GRAPH
|
|
ผู้สร้างผลงาน |
ZERARKA, M.F.
|
|
Description |
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 vertices of G to the vertices of H. The dilation of embedding is the maximum distance between f(u), f(v) taken over edges (u, v) of G. The Pancake graph is one as viable interconnection scheme for parallel computers, which has been examined by a number of researchers. The Pancake was proposed as alternatives to the hypercube for interconnecting processors in parallel computer. Some good attractive properties of this interconnection network include: vertex symmetry, small degree, a sub-logarithmic diameter, extendability, and high connectivity (robustness), easy routing and regularity of topology, fault tolerance, extensibility and embeddability of others topologies. In this paper, we give a construction of one by one embedding of dilation 5 of crossed hypercube into Pancake graph.
|
|
Publisher |
Université de Biskra
|
|
Contributor |
University of Biskra
|
|
วันที่ |
2017-02-06
|
|
ประเภท |
info:eu-repo/semantics/article
|
|
ประเภท |
info:eu-repo/semantics/publishedVersion
|
|
ประเภท |
Article évalué par les pairs
|
|
รูปแบบ |
application/pdf
|
|
Identifier |
http://revues.univ-biskra.dz/index.php/cds/article/view/1920
|
|
แหล่งข้อมูล |
Courrier du Savoir; Vol. 22 (2017): COURRIER DU SAVOIR (JANVIER)
|
|
แหล่งข้อมูล |
Courrier du Savoir; Vol. 22 (2017): COURRIER DU SAVOIR (JANVIER)
|
|
แหล่งข้อมูล |
1112-3338
|
|
แหล่งข้อมูล |
1112-3338
|
|
ภาษา |
fra
|
|
Relation |
http://revues.univ-biskra.dz/index.php/cds/article/view/1920/1727
|
แสดงรายละเอียดบรรณานุกรม
QR code
กลับ
Copyright 2025. All Rights Reserved.