𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The diameter of the cube-connected cycles

✍ Scribed by Ivan Friš; Ivan Havel; Petr Liebl


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
302 KB
Volume
61
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis


Cube-connected cycles, or CCC, are graphs with properties which make them possible candidates for switching patterns of multiprocessor computers.


📜 SIMILAR VOLUMES


Multiscattering on the cube-connected cy
✍ Jian-jin Li 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 589 KB

This paper presents several multiscattering algorithms on the Cube-Connected Cycles (CCC). We first implement a network-independent greedy algorithm. Then we propose two specialized algorithms for multiscattering on the CCC: the first approach uses only one hypercube link of each cycle, but the seco

On the Construction of Fault-Tolerant Cu
✍ J. Bruck; R. Cypher; C.T. Ho 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 772 KB

This paper presents a new approach to tolerating edge faults and node faults in (CCC) networks of Cube-Connected Cycles in a worst-case scenario. Our constructions of fault-tolerant CCC networks are obtained by adding extra edges to the CCC. The main objective is to reduce the cost of the fault-tole

Hamilton-connectivity and cycle-embeddin
✍ Jianxi Fan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 68 KB

The recently introduced interconnection network, the Möbius cube, is an important variant of the hypercube. This network has several attractive properties compared with the hypercube. In this paper, we show that the n-dimensional Möbius cube M n is Hamilton-connected when n 3. Then, by using the Ham

Connectivity of the crossed cube
✍ Priyalal D. Kulasinghe 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 569 KB

It was speculated that the connectivity of the n-dimensional crossed cube is n. In this paper we prove that the result is true. @ 1997 Elsevier Science B.V.