Queue layouts of planar 3-trees
From MaRDI portal
Publication:5915942
DOI10.1007/978-3-030-04414-5_15zbMath1475.05045arXiv1808.10841OpenAlexW2889544735MaRDI QIDQ5915942
No author found.
Publication date: 15 February 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.10841
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (6)
Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Queue layouts of planar 3-trees ⋮ Queue layouts of planar 3-trees ⋮ Planar Graphs of Bounded Degree Have Bounded Queue Number ⋮ On mixed linear layouts of series-parallel graphs ⋮ On Mixed Linear Layouts of Series-Parallel Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph layouts via layered separators
- On the queue-number of graphs with bounded tree-width
- Embedding planar graphs in four pages
- Stack and Queue Layouts via Layered Separators
- Minimum-Area Drawings of Plane 3-Trees
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Mixed Linear Layouts of Planar Graphs
- On Crossing Sets, Disjoint Sets, and Pagenumber
- Graph Drawing
- Layout of Graphs with Bounded Tree-Width
- On the Queue Number of Planar Graphs
- Sorting Using Networks of Queues and Stacks
- Graph-Theoretic Concepts in Computer Science
- Queue layouts of planar 3-trees
- Stack and queue number of 2-trees
This page was built for publication: Queue layouts of planar 3-trees