Stack and queue number of 2-trees
We consider the two problems of embedding graphs in a minimum number of pages and ordering the vertices of graphs in the form of queue layouts. We show that the class of 2-trees requires 2-pages for a book embedding and 3-queues for a queue layout. The first result is new and the latter result extends known results on subclasses of planar graphs.
Unable to display preview. Download preview PDF.
- [R 83]A.L.Rosenberg, “The DIOGENES approach to testable fault-tolerant arrays”, IEEE Transaction on Computer, C-32, 1983, pp.902–910.Google Scholar
- [CLR 87]F.Chung, T.Leighton, A.L.Rosenberg, “Embedding graphs in books: A Lay-out problem with applications to VLSI Design”, SIAM Jl. on Algebraic and Discrete Methods, 8, 1987, pp.33–58.Google Scholar
- [BK 79]F.Bernhart, P.C.Kainen, “The book thickness of a graph”, J. Comb. Theory, Ser.B, 27, 1979, pp.320–331.Google Scholar
- [HR 92]
- [M 94]
- [MW 93]
- [B 91]B.Obrenic, “Embedding deBruijn and shuffle-exchange graphs in five pages”, Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pp.137–146, 1991.Google Scholar