Lazy Queue Layouts of Posets

DOI10.1007/978-3-030-68766-3_5OpenAlexW3135730089MaRDI QIDQ5014104FDOQ5014104

Authors:

Publication date: 1 December 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Recommendations

• The queue-number of posets of bounded width or height
• On the queue-number of partial orders
• Stack and Queue Layouts of Posets
• On the queue-number of graphs with bounded tree-width
• On the queue number of planar graphs

zbMATH Keywords

posetslinear extensionsqueue layouts

Mathematics Subject Classification ID

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

Cites Work

• Stack and Queue Layouts of Directed Acyclic Graphs: Part II
• Laying Out Graphs Using Queues
• On the Queue Number of Planar Graphs
• A decomposition theorem for partially ordered sets
• Title not available (Why is that?)
• Stack and Queue Layouts of Directed Acyclic Graphs: Part I
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Stack and Queue Layouts of Posets
• Graph layouts via layered separators
• On the queue-number of graphs with bounded tree-width
• Mixed linear layouts of planar graphs
• The queue-number of posets of bounded width or height
• On the page number of upward planar directed acyclic graphs
• Planar graphs have bounded queue-number
• Four pages are indeed necessary for planar graphs
• Queue layouts of planar 3-trees
• Stack and queue number of 2-trees

Cited In (5)

• The queue-number of posets of bounded width or height
• Parameterized algorithms for queue layouts
• Linear layouts of bipartite planar graphs
• On the queue-number of partial orders
• Queue layouts of two-dimensional posets

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)