Name
Abstract | ||
|---|---|---|
The (s + t + 1)-dimensional exchanged crossed cube, denoted as ECQ(s, t), combines the strong points of the exchanged hypercube and the crossed cube. It has been proven that ECQ(s, t) has more attractive properties than other variations of the fundamental hypercube in terms of fewer edges, lower cost factor and smaller diameter. In this paper, we study the embedding of paths of distinct lengths between any two different vertices in ECQ(s, t). We prove the result in ECQ(s, t): if s ≥ 3, t ≥ 3, for any two different vertices, all paths whose lengths are between \( \max \left\{9,\left\lceil \frac{s+1}{2}\right\rceil +\left\lceil \frac{t+1}{2}\right\rceil +4\right\} \) and 2 s+t+1 − 1 can be embedded between the two vertices with dilation 1. Note that the diameter of ECQ(s, t) is \( \left\lceil \frac{s+1}{2}\right\rceil +\left\lceil \frac{t+1}{2}\right\rceil +2 \). The obtained result is optimal in the sense that the dilations of path embeddings are all 1. The result reveals the fact that ECQ(s, t) preserves the path embedding capability to a large extent, while it only has about one half edges of CQ n . |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s11390-017-1729-8 | J. Comput. Sci. Technol. |
Keywords | Field | DocType |
interconnection network, exchanged crossed cube, path embedding, parallel computing system | Combinatorics,Embedding,Dilation (morphology),Vertex (geometry),Computer science,Hypercube,Distributed computing,Cube | Journal |
Volume | Issue | ISSN |
32 | 3 | 1000-9000 |
Citations | PageRank | References |
5 | 0.44 | 24 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dongfang Zhou | 1 | 10 | 1.97 |
| Jianxi Fan | 2 | 718 | 60.15 |
| Cheng-kuan Lin | 3 | 476 | 46.58 |
| Baolei Cheng | 4 | 34 | 6.94 |
| Jing-Ya Zhou | 5 | 64 | 16.35 |
| Zhao Liu | 6 | 25 | 10.73 |