Longest fault-free paths in star graphs with vertex faults

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

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

Title:	Longest fault-free paths in star graphs with vertex faults
Authors:	Hsieh,SY;Chen,GH;Ho,CW
Contributors:	資訊工程研究所
Keywords:	NETWORKS;HYPERCUBES;MESHES
Date:	2001
Issue Date:	2010-07-06 18:22:04 (UTC+8)
Publisher:	中央大學
Abstract:	The star graph S, has been recognized as an attractive alternative to the hypercube. Since S-1, S-2, and S-3 have trivial structures, we focus our attention on S-n with n greater than or equal to4 in this paper. Let F, denote the set of faulty vertices in
Relation:	THEORETICAL COMPUTER SCIENCE
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	435	View/Open

社群 sharing