Efficient scheme for embedding a ring into an injured hypercube with both faulty links and faulty nodes

Yu-Chee Tseng*

*Corresponding author for this work

Research output: Contribution to conferencePaper

1 Scopus citations

Abstract

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.

Original languageEnglish
Pages165-169
Number of pages5
DOIs
StatePublished - 1 Dec 1996
EventProceedings of the 1996 3rd International Conference on High Performance Computing, HiPC - Trivandrum, India
Duration: 19 Dec 199622 Dec 1996

Conference

ConferenceProceedings of the 1996 3rd International Conference on High Performance Computing, HiPC
CityTrivandrum, India
Period19/12/9622/12/96

Cite this