By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yu-Chee Tseng ; Inst. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Chung-Li, Taiwan

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

Published in:

High Performance Computing, 1996. Proceedings. 3rd International Conference on

Date of Conference:

19-22 Dec 1996