Duckworth, William; Gibbons, Alan
In this paper we first present new proofs, much shorter and much simpler than can be found elsewhere, of two facts about Hypercubes: that for the d-dimensional Hypercube, there exists sets of paths by which any permutation routing task may be accomplished in at most 2d - 1 steps without queueing and, when d is even, there exists an edge decomposition of the Hypercube into precisely d/2 edge-disjoint Hamiltonian cycles. The permutation routing paths are computed off-line. Whether or not these...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.