Results 1 
1 of
1
Routing Permutations and 21 Routing Requests in the Hypercube
, 2000
"... Let H n be the directed symmetric ndimensional hypercube. Using the computer, we show that for any permutation of the vertices of H 4 , there exists a system of pairwise arcdisjoint directed paths from each vertex to its target in the permutation. This veries Szymanski's conjecture [8] for n ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Let H n be the directed symmetric ndimensional hypercube. Using the computer, we show that for any permutation of the vertices of H 4 , there exists a system of pairwise arcdisjoint directed paths from each vertex to its target in the permutation. This veries Szymanski's conjecture [8] for n = 4.