Stack and queue layouts of directed acyclic graphs: Part II

SIAM Journal on Computing

Volumn 28, Issue 5, 1999, Pages 1588-1626

  Heath, Lenwood S ^a   Pemmaraju, Sriram V ^b  

^a Virginia Polytechnic Institute and State University   (United States)

^b The University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FAULT TOLERANT COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS; QUEUEING THEORY; RANDOM PROCESSES; SCHEDULING;

BOOK EMBEDDING; DIRECTED ACYCLIC GRAPHS; POSETS; QUEUE LAYOUT; STACK LAYOUT;

GRAPH THEORY;

EID: 0032606848     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795291550     Document Type: Article

References (13)

1. F. BERNHART AND P. C. KAINEN, The book thickness of a graph, J, Combin. Theory Ser. B, 27 (1979), pp. 320-331.
2. K. S. BOOTH AND G. S. LUEKER, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. System Sci., 13 (1976), pp. 335-379.
3. M. CHANDRAMOULI AND A. A. DIWAN, Upward numbering testing for triconnected graphs, in Graph Drawing, GD '95, F. J. Brandenburg, ed., Lecture Notes in Comput. Sci. 1027, Springer-Verlag, Berlin, 1996, pp. 140-151.
4. M. CHANDRAMOULI, Upward Planar Graph Drawings, Ph.D. thesis, IIT Bombay, 1994.
5. G. DI BATTISTA AND E. NARDELLI, Hierarchies and planarity theory, IEEE Trans. Systems Man Cybernet., 18 (1988), pp. 1035-1046.
6. F. HARARY AND G. PRINS, The block-cutpoint-tree of a graph, Publ. Math. Debrecen, 13 (1966), pp. 103-107.
7. L. S. HEATH AND S. V. PEMMARAJU, Recognizing leveled-planar dags in linear time, in Graph Drawing, GD '95, F. J. Brandenburg, ed., Lecture Notes in Comput. Sci. 1027, Springer-Verlag, Berlin, 1996, pp. 300-311.
8. L. S. HEATH AND S. V. PEMMARAJU, Stack and queue, layouts of posets, SIAM J. Discrete Math., 10 (1997), pp. 599-625.
9. L. S. HEATH, S. V. PEMMARAJU, AND A. TRENK, Stack and queue layouts of directed acyclic graphs: Part I, SIAM J. Comput., (28 (1999), pp. 1510-1539.
10. L. S. HEATH, S. V. PEMMARAJU, AND A. TRENK, Stack and queue layouts of directed acyclic graphs, in Planar Graphs, W. T. Trotter, ed., AMS, Providence, RI, 1993, pp. 5-11.
11. L. S. HEATH AND A. L. ROSENBERG. Laying out graphs using queues, SIAM J. Comput., 21 (1992), pp. 927-958.
12. M. M. SYSLO AND M. IRI, Efficient outerplanarity testing, Fund. Inform., 2 (1979), pp. 261-275.
13. M. YANNAKAKIS, The complexity of the partial order dimension problem, SIAM J. Alg. Discrete Methods, 3 (1982), pp. 351-358.