Lazy queue layouts of posets

DOI10.1007/s00453-022-01067-yOpenAlexW3080632939MaRDI QIDQ2701382

Yanyan Li

Publication date: 28 April 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-01067-y

zbMATH Keywords

posetslinear extensionsqueue layouts

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Graph layouts via layered separators
• On the queue-number of graphs with bounded tree-width
• The queue-number of posets of bounded width or height
• On the queue-number of partial orders
• Planar graphs that need four pages
• A decomposition theorem for partially ordered sets
• Stack and Queue Layouts via Layered Separators
• Laying Out Graphs Using Queues
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• 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
• Mixed Linear Layouts of Planar Graphs
• On the Page Number of Upward Planar Directed Acyclic Graphs
• Four pages are indeed necessary for planar graphs
• On the Queue Number of Planar Graphs
• Queue layouts of planar 3-trees
• Stack and queue number of 2-trees

This page was built for publication: Lazy queue layouts of posets