Content deleted Content added
Remove link to the geometric hypercube, which is a 4th dimensional object, whereas apparently a 4th dimension is not a requirement in the computer network form of hypercube (or these articles need to be rewritten to indicate that it is) |
See also Hypercube internetwork topology |
||
Line 86:
This section describes how to construct the binomial trees systematically. First, construct a single binomial spanning tree von <math>2^d</math> nodes as follows. Number the nodes from <math>0</math> to <math>2^d - 1</math> and consider their binary representation. Then the children of each nodes are obtained by negating single leading zeroes. This results in a single binomial spanning tree. To obtain <math>d</math> edge-disjoint copies of the tree, translate and rotate the nodes: for the <math>k</math>-th copy of the tree, apply a XOR operation with <math>2^k</math> to each node. Subsequently, right-rotate all nodes by <math>k</math> digits. The resulting binomial trees are edge-disjoint and therefore fulfill the requirements for the ESBT-broadcasting algorithm.
== See also ==
* [[Hypercube internetwork topology]]
==References==
| |||