| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429205 | Information Processing Letters | 2007 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
