Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
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
Containment of butterflies in networks constructed by the line digraph operation
Information Processing Letters
Hamilton circuits in the directed wrapped Butterfly network
Discrete Applied Mathematics
Stack and Queue Layouts of Directed Acyclic Graphs: Part I
SIAM Journal on Computing
Sorting Using Networks of Queues and Stacks
Journal of the ACM (JACM)
Stack and Queue Layouts of Directed Acyclic Graphs: Part II
SIAM Journal on Computing
Stack and Queue Number of 2-Trees
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Layout of Graphs with Bounded Tree-Width
SIAM Journal on Computing
Line Digraph Iterations and the (d, k) Digraph Problem
IEEE Transactions on Computers
The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors
IEEE Transactions on Computers
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
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
Note: On the (h,k)-domination numbers of iterated line digraphs
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics
| Hi-index | 0.04 |
In this paper, we study queue layouts of iterated line directed graphs. A k-queue layout of a directed graph consists of a linear ordering of the vertices and an assignment of each arc to exactly one of the k queues so that any two arcs assigned to the same queue do not nest. The queuenumber of a directed graph is the minimum number of queues required for a queue layout of the directed graph. We present upper and lower bounds on the queuenumber of an iterated line directed graph L^k(G) of a directed graph G. Our upper bound depends only on G and is independent of the number of iterations k. Queue layouts can be applied to three-dimensional drawings. From the results on the queuenumber of L^k(G), it is shown that for any fixed directed graph G, L^k(G) has a three-dimensional drawing with O(n) volume, where n is the number of vertices in L^k(G). These results are also applied to specific families of iterated line directed graphs such as de Bruijn, Kautz, butterfly, and wrapped butterfly directed graphs. In particular, the queuenumber of k-ary butterfly directed graphs is determined if k is odd.