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

NCU Institutional Repository > 資訊電機學院 > 資訊工程研究所 > 期刊論文 > Item 987654321/29219

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29219

题名:	On the embedding of a class of regular graphs in a faulty hypercube
作者:	Tseng,YC;Lai,TH
贡献者:	資訊工程研究所
关键词:	NETWORKS
日期:	1996
上传时间:	2010-06-29 20:16:41 (UTC+8)
出版者:	中央大學
摘要:	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.
關聯:	JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
显示于类别:	[資訊工程研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	446	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing