In this paper, we show that given a binary n-cube with fe ≤n-4 faulty edges and fv≤n-1 faulty vertices such that fe+fv≤n-1, a ring of length at least 2n-2fv can be obtained. On the contrary, existing results can tolerate only faulty edges or only faulty vertices.
|Number of pages||5|
|State||Published - 1 Dec 1996|
|Event||Proceedings of the 1996 3rd International Conference on High Performance Computing, HiPC - Trivandrum, India|
Duration: 19 Dec 1996 → 22 Dec 1996
|Conference||Proceedings of the 1996 3rd International Conference on High Performance Computing, HiPC|
|Period||19/12/96 → 22/12/96|