A survey of graph layout problems
ACM Computing Surveys (CSUR)
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Queue layouts of iterated line directed graphs
Discrete Applied Mathematics
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Characterization of unlabeled level planar trees
Computational Geometry: Theory and Applications
Processor-efficient sparse matrix-vector multiplication
Computers & Mathematics with Applications
Characterization of unlabeled level planar trees
GD'06 Proceedings of the 14th international conference on Graph drawing
Computing upward topological book embeddings of upward planar digraphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Plane drawings of queue and deque graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Volume requirements of 3d upward drawings
GD'05 Proceedings of the 13th international conference on Graph Drawing
On the characterization of level planar trees by minimal patterns
GD'09 Proceedings of the 17th international conference on Graph Drawing
Characterizations of deque and queue graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
On the page number of upward planar directed acyclic graphs
GD'11 Proceedings of the 19th international conference on Graph Drawing
SIAM Journal on Discrete Mathematics
How to efficiently implement dynamic circuit specialization systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.00 |
Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags). A stack layout of a dag is similar to a stack layout of an undirected graph, with the additional requirement that the nodes of the dag be in some topological order. A queue layout is defined in an analogous manner. The stacknumber ( queuenumber) of a dag is the smallest number of stacks (queues) required for its stack layout (queue layout). This paper presents algorithmic results---in particular, linear time algorithms for recognizing 1-stack dags and 1-queue dags, and proofs of NP-completeness for the problem of recognizing a 4-queue dag and the problem of recognizing a 6-stack dag. The companion paper (Part I [ SIAM J. Comput., 28 (1999), pp. 1510--1539.]) presents combinatorial results.