Copyright © 2007 Elsevier B.V. All rights reserved.
An improved upper bound on the queuenumber of the hypercube
Received 28 March 2007;
revised 1 May 2007.
Communicated by L. Boasson.
Available online 18 May 2007.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In this note, we show that the n-dimensional hypercube Q(n) can be laid out using n−2 queues for all n
5. Our result improves the previously known result for the case n
5.
Keywords: Combinatorial problems; Queue layout; Hypercube; Interconnection networks







E-mail Article
Add to my Quick Links

Cited By in Scopus (1)






