In this paper, we propose two types of spanning trees in incomplete hypercubes (composed of an n-cube and a k-cube): the binomial hierarchical spanning tree- ...

In this paper, we propose two types of spanning trees in incomplete hypercubes (composed of an n-cube and a k-cube): the binomial hierarchical spanning tree- ...

The authors devise and analyze broadcasting algorithms based on the hierarchical binomial spanning trees, hierarchical edge-disjoint spanning trees and edge ...

An incomplete hypercube is a generalization of the well known hypercube network such that its number of nodes can be arbitrary as opposed to a strict power ...

Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes.

We also show that many host architectures, such as binary trees, arrays and butterflies, can be optimally embedded into composite hypercubes. These results ...

Then we embed spanning trees into the hypercube and disseminate control ... First, we have to consider incomplete hypercubes with. N < 2n nodes. When ...

Hierarchical spanning trees and distributing on incomplete hypercubes · J. TienWei-Pang Yang. Computer Science, Mathematics. Parallel Comput. 1991. 8 Citations.

-P. Yang, “Hierarchical spanning trees and distributing on incomplete hypercubes,” Parallel Compuf., vol. 17, pp. 1343-1360,.

spanning trees that are wholly contained within the incomplete hypercube, so no link references a label that is not present within the incomplete hypercube.