Stack and queue layouts of posets

SIAM Journal on Discrete Mathematics

Volumn 10, Issue 4, 1997, Pages 599-625

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

^a State University   (United States)

^b University of Iowa   (United States)

Author keywords

Book embedding; Hasse diagram; Jumpnumber; Poset; Queue layout; Stack layout

Indexed keywords

EID: 0344611549     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480193252380     Document Type: Article

References (21)

1. F. BERNHART AND P. C. KAINEN, The book thickness of a graph, J. Combin. Theory Ser. B, 27 (1979), pp. 320-331.
2. G. BIRKHOFF, Lattice Theory, American Mathematical Society, Providence, RI, 1940.
3. F. R. K. CHUNG, F. T. LEIGHTON, AND A. L. ROSENBERG, Embedding graphs in books: A layout problem with applications to VLSI design, SIAM J. Alg. Discrete Methods, 8 (1987), pp. 33-58.
4. B. A. DAVEY AND H. A. PRIESTLY, Introduction to Lattices and Order, Cambridge University Press, New York, 1990.
5. R. P. DILWORTH, A decomposition theorem for partially ordered sets, Ann. of Math., 51 (1950), pp. 161-166.
6. P. ERDÖS AND G. SZEKERES, A combinatorial problem in geometry, Compositio Math., 2 (1935), pp. 463-470.
7. P. C. FISHBURN, Thicknesses of ordered sets, SIAM J. Discrete Math., 3 (1990), pp. 489-501.
8. L. S. HEATH, F. T. LEIGHTON, AND A. L. ROSENBERG, Comparing queues and stacks as mechanisms for laying out graphs, SIAM J. Discrete Math., 5 (1992), pp. 398-412.
9. L. S. HEATH AND S. V. PEMMARAJU, Stack and queue layouts of directed acyclic graphs: Part II, SIAM J. Comput. Sci., to appear.
10. L. S. HEATH, S. V. PEMMARAJU, AND C. J. RIBBENS, Sparse Matrix-Vector Multiplication on a Small Linear Array, Technical Report TR93-11, Dept. of Computer Science, Virginia Polytechnic and State University, Blacksburg, VA, 1993.
11. L. S. HEATH, S. V. PEMMARAJU, AND A. TRENK, Stack and queue layouts of directed acyclic graphs, in Planar Graphs, W. T. Trotter, ed., American Mathematical Society, Providence, RI, 1993, pp. 5-11.
12. L. S. HEATH, S. V. PEMMARAJU, AND A. TRENK, Stack and queue layouts of directed acyclic graphs: Part I, SIAM J. Comput. Sci., to appear.
13. L. S. HEATH AND A. L. ROSENBERG, Laying out graphs using queues, SIAM J. Comput., 21 (1992), pp. 927-958.
14. L. T. Q. HUNG, A Planar Poset which Requires 4 Pages, Institute of Computer Science, University of Wroclaw, typescript, 1989.
15. R. NOWAKOWSKI AND A. PARKER, Ordered sets, pagenumbers and planarity, Order, 6 (1989), pp. 209-218.
16. S. V. PEMMARAJU, Exploring the Powers of Stacks and Queues via Graph Layouts, Ph.D. thesis, Virginia Polytechnic Institute and State University, Blacksburg, VA, 1992.
17. M. M. SYSŁO, Bounds to the page number of partially ordered sets, in Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science, M. Nagl, ed., Springer-Verlag, Berlin, 1989, pp. 181-195.
18. M. M. SYSŁO AND M. IRI, Efficient outerplanarity testing, Fund. Inform., 2 (1979), pp. 261-275.
19. A. WIGDERSON, The complexity of the Hamiltonian circuit problem for maximal planar graphs, Tech. Report 82-298, Electrical Engineering and Computer Science Department, Princeton University, Princeton, NJ, 1982.
20. M. YANNAKAKIS, The complexity of the partial order dimension problem, SIAM J. Alg. Discrete Methods, 3 (1982), pp. 351-358.
21. M. YANNAKAKIS, Embedding planar graphs in four pages, J. Comput. System Sci., 38 (1989), pp. 36-67.