On the embedding of a class of regular graphs in a faulty hypercube

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

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

Title:	On the embedding of a class of regular graphs in a faulty hypercube
Authors:	Tseng,YC;Lai,TH
Contributors:	資訊工程研究所
Keywords:	NETWORKS
Date:	1996
Issue Date:	2010-06-29 20:16:41 (UTC+8)
Publisher:	中央大學
Abstract:	In a hypercube of high dimension, the interconnection is quite complex and thus links are likely to fail. In this paper, a general, systematic solution is proposed for the embedding of a group of regular graphs in an injured hypercube with faulty links. These graphs include rings, linear paths, binomial trees, binary trees, meshes, tori, products of the above graphs, and many others. Unlike many existing algorithms which are capable of embedding only one type of graphs, our algorithm embeds the above graphs in a unified way, all centered around a notion called edge matrix. (C) 1996 Academic Press, Inc.
Relation:	JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
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	441	View/Open

社群 sharing