Distributed ring embedding in faulty De Bruijn networks
โ Scribed by Rowley, R.A.; Bose, B.
- Book ID
- 119772597
- Publisher
- IEEE
- Year
- 1997
- Tongue
- English
- Weight
- 108 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0018-9340
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we consider the fault hamiltonicity and the fault hamiltonian connectivity of the pancake graph Moreover, all the bounds are optimal.
We show that the de Bruijn digraph B(d,D), D > 1 and the Kautz digraph K(d,D) can be embedded in (d + 1) pages with cumulative pagewidth ~dDe2(3d3 -2d2 + 4d -d(d mod 2) ~ 4) and idD-'(3d' + 4d + (d mod2)), respectively. Also we show that the shuffle-exchange graph S(D; D > 2 can be embedded in 3 pag
Assume that m and n are positive even integers with n 4. The honeycomb rectangular torus HReT(m, n) is recognized as another attractive alternative to existing torus interconnection networks in parallel and distributed applications. It is known that any HReT(m, n) is a 3-regular bipartite graph. We