Routing a Permutation in the Hypercube b
β
Qian-Ping Gu; Hisao Tamaki
π
Article
π
1997
π
Elsevier Science
π
English
β 95 KB
Consider a hypercube regarded as a directed graph, with one edge in each direction between each pair of adjacent nodes. We show that any permutation on the hypercube can be partitioned into two partial permutations of the same size so that each of them can be routed by edge-disjoint directed paths.