BROADCASTING ON INCOMPLETE HYPERCUBES
檔案
- A1993MM22100010.pdf (708.3 KB, Adobe PDF)
日期
1993-11-01
類型
系所
期刊名稱
IEEE TRANSACTIONS ON COMPUTERS
卷期與頁次
第 42 卷第 11 期,頁 1393–1398
ISSN
0018-9340
語言
英文
摘要
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.