Issue No. 11 - November (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.247842
<p>Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes. The authors devise and analyze a broadcasting algorithm based on edge-disjoint spanning trees in an incomplete hypercube of 2/sup n/+2/sup k/ nodes, where 0>or=k>n. The broadcasting algorithm is strictly optimal.</p>
incomplete hypercube; faulty nodes; broadcasting algorithm; edge-disjoint spanning trees; delays; hypercube networks; trees (mathematics).
J. Tien, W. Yang and C. Ho, "Broadcasting on Incomplete Hypercubes," in IEEE Transactions on Computers, vol. 42, no. , pp. 1393-1398, 1993.