Advertisement

The Queue-Number of Posets of Bounded Width or Height

  • Kolja KnauerEmail author
  • Piotr Micek
  • Torsten Ueckerdt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11282)

Abstract

Heath and Pemmaraju [9] conjectured that the queue-number of a poset is bounded by its width and if the poset is planar then also by its height. We show that there are planar posets whose queue-number is larger than their height, refuting the second conjecture. On the other hand, we show that any poset of width 2 has queue-number at most 2, thus confirming the first conjecture in the first non-trivial case. Moreover, we improve the previously best known bounds and show that planar posets of width w have queue-number at most \(3w-2\) while any planar poset with 0 and 1 has queue-number at most its width.

References

  1. 1.
    Baker, K.A., Fishburn, P.C., Roberts, F.S.: Partial orders of dimension 2. Networks 2(1), 11–28 (1972)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Di Battista, G., Liu, W.-P., Rival, I.: Bipartite graphs, upward drawings, and planarity. Inf. Process. Lett. 36(6), 317–322 (1990)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 2(51), 161–166 (1950)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Dujmović, V., Pór, A., Wood, D.R.: Track layouts of graphs. Discret. Math. Theor. Comput. Sci. 6(2), 497–522 (2004)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Dujmović, V., Wood, D.R.: Stacks queues and tracks: layouts of graph subdivisions. Discret. Math. Theor. Comput. Sci. 7(1), 155–202 (2005)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psychol. 7, 144–149 (1970)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Habib, M., Jegou, R.: N-free posets as generalizations of series-parallel posets. Discret. Appl. Math. 12, 279–291 (1985)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Heath, L.S., Leighton, F.T., Rosenberg, A.L.: Comparing queues and stacks as machines for laying out graphs. SIAM J. Discret. Math. 5(3), 398–412 (1992)CrossRefGoogle Scholar
  9. 9.
    Heath, L.S., Pemmaraju, S.V.: Stack and queue layouts of posets. SIAM J. Discret. Math. 10(4), 599–625 (1997)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Heath, L.S., Rosenberg, A.L.: Laying out graphs using queues. SIAM J. Comput. 21(5), 927–958 (1992)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Knauer, K., Micek, P., Ueckerdt, T.: The queue-number of posets of bounded width or height. arXiv:1806.04489v4 (2018). https://arxiv.org/abs/1806.04489v4
  12. 12.
    Moore, J.I.: Graphs and partially ordered sets. Ph.D. thesis, University of South Carolina (1975)Google Scholar
  13. 13.
    Nešetřil, J., de Mendez, P.O., Wood, D.R.: Characterisations and examples of graph classes with bounded expansion. Eur. J. Comb. 33(3), 350–373 (2012).  https://doi.org/10.1016/j.ejc.2011.09.008MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Pemmaraju, S.V.: Exploring the powers of stacks and queues via graph layouts. Ph.D. thesis, Virginia Polytechnic Institute & State University, Blacksburg, Virginia (1992)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Aix Marseille Univ, Université de Toulon, CNRS, LISMarseilleFrance
  2. 2.Faculty of Mathematics and Computer Science, Theoretical Computer Science DepartmentJagiellonian UniversityKrakówPoland
  3. 3.Karlsruhe Institute of Technology (KIT), Institute of Theoretical InformaticsKarlsruheGermany

Personalised recommendations