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

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > journal & Dissertation > Item 987654321/29214

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29214

Title:	Embedding a ring in a hypercube with both faulty links and faulty nodes
Authors:	Tseng,YC
Contributors:	資訊工程研究所
Keywords:	NETWORKS
Date:	1996
Issue Date:	2010-06-29 20:16:33 (UTC+8)
Publisher:	中央大學
Abstract:	In this paper, we show that given a binary n-cube with f(e) less than or equal to n - 4 faulty edges and f(v) less than or equal to n - 1 faulty vertices such that f(e) + f(v) less than or equal to n - 1, a ring of length at least 2(n) - 2f(v) can be obtained. The best known results can tolerate only faulty edges or only faulty vertices.
Relation:	INFORMATION PROCESSING LETTERS
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	400	View/Open

社群 sharing