Balanced spanning trees in complete and incomplete star graphs

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

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

题名:	Balanced spanning trees in complete and incomplete star graphs
作者:	Chen,TS;Tseng,YC;Sheu,JP
贡献者:	資訊工程研究所
关键词:	BROADCASTING ALGORITHM;COMMUNICATION;HYPERCUBES;NETWORK
日期:	1996
上传时间:	2010-06-29 20:16:30 (UTC+8)
出版者:	中央大學
摘要:	Efficiently solving the personalized broadcast problem in an interconnection network typically relies on finding an appropriate spanning tree in the network. In this paper, we show how to construct in a complete star graph an asymptotically balanced spanning tree, and in an incomplete star graph a near-balanced spanning tree. In both cases, the tree is shown to have the minimum height. In the literature, this problem has only been considered for the complete star graph, and the constructed tree is about 4/3 times taller than the one proposed in this paper.
關聯:	IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
显示于类别:	[資訊工程研究所] 期刊論文

文件中的档案:

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

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

社群 sharing