Lazy Queue Layouts of Posets
From MaRDI portal
Publication:5014104
Recommendations
Cites work
- scientific article; zbMATH DE number 2159644 (Why is no real title available?)
- A decomposition theorem for partially ordered sets
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Four pages are indeed necessary for planar graphs
- Graph layouts via layered separators
- Laying Out Graphs Using Queues
- Mixed linear layouts of planar graphs
- On the Queue Number of Planar Graphs
- On the page number of upward planar directed acyclic graphs
- On the queue-number of graphs with bounded tree-width
- Planar graphs have bounded queue-number
- Queue layouts of planar 3-trees
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II
- Stack and Queue Layouts of Posets
- Stack and queue number of 2-trees
- The queue-number of posets of bounded width or height
Cited in
(5)
This page was built for publication: Lazy Queue Layouts of Posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014104)