An improved upper bound on the queuenumber of the hypercube

Authors:
Toru Hasunuma;Misa Hirota
Affiliations:
Department of Mathematical and Natural Sciences, The University of Tokushima, 1-1 Minamijosanjima, Tokushima 770-8502, Japan;Department of Mathematical and Natural Sciences, The University of Tokushima, 1-1 Minamijosanjima, Tokushima 770-8502, Japan
Venue:
Information Processing Letters
Year:
2007

Citing 5
Cited 3

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Laying out graphs using queues

SIAM Journal on Computing
Layout of Graphs with Bounded Tree-Width

SIAM Journal on Computing
Queue layouts of iterated line directed graphs

Discrete Applied Mathematics
The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors

IEEE Transactions on Computers

A Note on “An improved upper bound on the queuenumber of the hypercube”

Information Processing Letters
Upper bounds on the queuenumber of k-ary n-cubes

Information Processing Letters
Queue Layouts of Hypercubes

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.89

Visualization

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.