Embedding of tree networks into hypercubes
The hypercube is a good host graph for the embedding of networks of processors because of its low degree and low diameter. Graphs such as trees and arrays can be embedded into a hypercube with small dilation and expansion costs, but there are classes of graphs which can be embedded into a hypercube...
Saved in:
| Published in | Journal of parallel and distributed computing Vol. 2; no. 3; pp. 238 - 249 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Inc
01.08.1985
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | The hypercube is a good host graph for the embedding of networks of processors because of its low degree and low diameter. Graphs such as trees and arrays can be embedded into a hypercube with small dilation and expansion costs, but there are classes of graphs which can be embedded into a hypercube only with large expansion cost or large dilation cost. |
|---|---|
| ISSN: | 0743-7315 1096-0848 |
| DOI: | 10.1016/0743-7315(85)90026-7 |