BROADCASTING ON INCOMPLETE HYPERCUBES

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	TIEN, JY	en_US
dc.contributor.author	HO, CT	en_US
dc.contributor.author	YANG, WP	en_US
dc.date.accessioned	2014-12-08T15:04:18Z	-
dc.date.available	2014-12-08T15:04:18Z	-
dc.date.issued	1993-11-01	en_US
dc.identifier.issn	0018-9340	en_US
dc.identifier.uri	http://dx.doi.org/10.1109/12.247842	en_US
dc.identifier.uri	http://hdl.handle.net/11536/2804	-
dc.description.abstract	Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes. In this correspondence, we devise and analyze a broadcasting algorithm based on edge-disjoint spanning trees in an incomplete hypercube of 2n + 2k nodes, where 0 less-than-or-equal-to k less-than-or-equal-to n. The broadcasting algorithm is strictly optimal.	en_US
dc.language.iso	en_US	en_US
dc.subject	BROADCASTING	en_US
dc.subject	EDGE-DISJOINT SPANNING TREES	en_US
dc.subject	INCOMPLETE HYPERCUBES	en_US
dc.subject	ROUTING	en_US
dc.title	BROADCASTING ON INCOMPLETE HYPERCUBES	en_US
dc.type	Note	en_US
dc.identifier.doi	10.1109/12.247842	en_US
dc.identifier.journal	IEEE TRANSACTIONS ON COMPUTERS	en_US
dc.citation.volume	42	en_US
dc.citation.issue	11	en_US
dc.citation.spage	1393	en_US
dc.citation.epage	1398	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1993MM22100010	-
dc.citation.woscount	11	-
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。