Embedding graphs in books: a layout problem with applications to VLSI design
SIAM Journal on Algebraic and Discrete Methods
Comparing queues and stacks as mechanisms for laying out graphs
SIAM Journal on Discrete Mathematics
Laying out graphs using queues
SIAM Journal on Computing
Exploring the powers of stacks and queues via graph layouts
Exploring the powers of stacks and queues via graph layouts
Scheduling tree-dags using FIFO queues: a control-memory trade-off
Journal of Parallel and Distributed Computing
Stack and Queue Layouts of Directed Acyclic Graphs: Part I
SIAM Journal on Computing
On crossing sets, disjoint sets, and pagenumber
Journal of Algorithms
Stack and Queue Layouts of Directed Acyclic Graphs: Part II
SIAM Journal on Computing
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Stack and Queue Layouts of Posets
SIAM Journal on Discrete Mathematics
Stack and Queue Number of 2-Trees
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Layout of Graphs with Bounded Tree-Width
SIAM Journal on Computing
Queue layouts of iterated line directed graphs
Discrete Applied Mathematics
An improved upper bound on the queuenumber of the hypercube
Information Processing Letters
A Note on “An improved upper bound on the queuenumber of the hypercube”
Information Processing Letters
Efficient compilation for queue size constrained queue processors
Parallel Computing
Upper bounds on the queuenumber of k-ary n-cubes
Information Processing Letters
| Hi-index | 0.00 |
A queue layout of a graph consists of a linear ordering $\sigma$ of its vertices and a partition of its edges into sets, called queues, such that in each set no two edges are nested with respect to $\sigma$. We show that the $n$-dimensional hypercube $Q_n$ has a layout into $n-\lfloor \log_2 n \rfloor$ queues for all $n\ge 1$. On the other hand, for every $\varepsilon0$, every queue layout of $Q_n$ has more than $(\frac{1}{2}-\varepsilon) n-O(1/\varepsilon)$ queues and, in particular, more than $(n-2)/3$ queues. This improves previously known upper and lower bounds on the minimal number of queues in a queue layout of $Q_n$. For the lower bound we employ a new technique of out-in representations and contractions which may be of independent interest.