Hypercubic Combinatorics: Hamiltonian Decomposition and Permutation Routing
Duckworth, William; Gibbons, Alan
Description
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]
Collections | ANU Research Publications |
---|---|
Date published: | 2007 |
Type: | Journal article |
URI: | http://hdl.handle.net/1885/38348 |
Source: | Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC) |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Duckworth_Hypercubic_Combinatorics:_2007.pdf | 688.29 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 23 August 2018/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator