Stack and queue number of 2-trees

  • S. Rengarajan
  • C. E. Veni Madhavan
Session 4A: Graph Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 959)


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.

Unable to display preview. Download preview PDF.


  1. [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
  2. [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
  3. [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
  4. [HR 92]
    L.S. Heath, A. Rosenberg, “Laying out graphs using queues”, SIAM Jl. on Computing, 21, 1992, pp.927–958.CrossRefGoogle Scholar
  5. [M 94]
    S.M.Malitz, “Graphs with E edges have pagenumber O(√E)”, J. Algorithms, 17, 1994, pp. 71–84, 85–109.CrossRefGoogle Scholar
  6. [MW 93]
    S. Moran and Y. Wolfsthal, “Two-page book embedding of trees under vertex-neighborhood constraints”, Discrete Appl. Math., 43, 1993, pp. 233–41.CrossRefGoogle Scholar
  7. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • S. Rengarajan
    • 1
  • C. E. Veni Madhavan
    • 1
  1. 1.Dept. of Computer Science & AutomationIndian Institute of ScienceBangaloreIndia

Personalised recommendations