On the queue-number of partial orders

DOI10.1007/978-3-030-92931-2_17OpenAlexW4205758352MaRDI QIDQ2151446

Torsten Ueckerdt, Kaja Wille, Stefan Felsner

Publication date: 1 July 2022

Full work available at URL: https://arxiv.org/abs/2108.09994

zbMATH Keywords

posetwidthlower boundsqueue-number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Queue layouts of two-dimensional posets ⋮ Lazy queue layouts of posets

Cites Work

• Unnamed Item
• On the queue-number of graphs with bounded tree-width
• Characterisations and examples of graph classes with bounded expansion
• The queue-number of posets of bounded width or height
• Laying Out Graphs Using Queues
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Stack and Queue Layouts of Posets
• Lazy Queue Layouts of Posets
• Planar Graphs Have Bounded Queue-Number

This page was built for publication: On the queue-number of partial orders