Embedding a ring in a hypercube with both faulty links and faulty nodes

Yu-Chee Tseng*

*Corresponding author for this work

Research output: Contribution to journalArticle

40 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. The best known results can tolerate only faulty edges or only faulty vertices.

Original languageEnglish
Pages (from-to)217-222
Number of pages6
JournalInformation Processing Letters
Volume59
Issue number4
DOIs
StatePublished - 26 Aug 1996

Keywords

  • Fault tolerance
  • Graph embedding
  • Hypercube
  • Interconnection network
  • Parallel processing
  • Ring

Fingerprint Dive into the research topics of 'Embedding a ring in a hypercube with both faulty links and faulty nodes'. Together they form a unique fingerprint.

  • Cite this