We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
IMPROVED BOUNDS ON CUTWIDTHS OF SHUFFLE-EXCHANGE AND DE BRUIJN GRAPHS.
- Authors
Monien, Burkhard; Vr&tbreve;o, Imrich
- Abstract
We prove that the cutwidth of the n-dimensional shuffle-exchange graph is at most [2n+1/n], for n ≥ 10. This essentially improves on the previous best constant factors. As a consequence we obtain an improved upper bound for the cutwidth of the de Bruijn graph.
- Subjects
GRAPHIC methods; PARALLEL processing; COMPUTER architecture; MULTIPROCESSORS; PARALLEL programming; MULTIPROGRAMMING (Electronic computers)
- Publication
Parallel Processing Letters, 2004, Vol 14, Issue 3/4, p361
- ISSN
0129-6264
- Publication type
Article
- DOI
10.1142/S0129626404001945