Longest fault-free paths in star graphs with edge faults

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

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

Title:	Longest fault-free paths in star graphs with edge faults
Authors:	Hsieh,SY;Chen,GH;Ho,CW
Contributors:	資訊工程研究所
Keywords:	HYPERCUBES;NETWORKS;MESHES
Date:	2001
Issue Date:	2010-07-06 18:22:02 (UTC+8)
Publisher:	中央大學
Abstract:	In this paper, we aim to embed longest fault-free paths in an n-dimensional star graph with edge faults. When n greater than or equal to 6 and there are n - 3 edge faults, a longest fault-free path can be embedded between two arbitrary distinct vertices,
Relation:	IEEE TRANSACTIONS ON COMPUTERS
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	406	View/Open

社群 sharing