A new upper bound on the queuenumber of hypercubes

作者：Pai Kung Jui; Chang Jou Ming; Wang Yue Li^*

来源：Discrete Mathematics, 2010, 310(4): 935-939.

DOI：10.1016/j.disc.2009.09.007

• Combinatorial problems
• Queue layout
• Hypercube
• Interconnection networks

A queue layout of a graph consists of a linear order of its vertices, and a partition of its edges into queues, such that no two edges in the same queue are nested. In this paper, we show that the n-dimensional hypercube Q(n) can be laid out using n - 3 queues for n >= 8. Our result improves the previously known result for the case n >= 8.

• 出版日期2010-2-28