Queue layouts of planar 3-trees
From MaRDI portal
Publication:5918924
DOI10.1007/S00453-020-00697-4zbMATH Open1457.05024OpenAlexW2952673825MaRDI QIDQ5918924FDOQ5918924
Author name not available (Why is that?)
Publication date: 3 September 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-020-00697-4
Recommendations
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Laying Out Graphs Using Queues
- Layout of Graphs with Bounded Tree-Width
- On the Queue Number of Planar Graphs
- Drawing graphs. Methods and models
- Embedding planar graphs in four pages
- On Crossing Sets, Disjoint Sets, and Pagenumber
- Sorting Using Networks of Queues and Stacks
- Minimum-Area Drawings of Plane 3-Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Graph layouts via layered separators
- Graph Drawing
- Stacks, queues and tracks: layouts of graph subdivisions
- Computing straight-line 3D grid drawings of graphs in linear volume
- Title not available (Why is that?)
- On the queue-number of graphs with bounded tree-width
- Tree-partitions of \(k\)-trees with applications in graph layout.
- Stack and Queue Layouts via Layered Separators
- Mixed Linear Layouts of Planar Graphs
- Queue layouts of planar 3-trees
- Planar Graphs of Bounded Degree Have Bounded Queue Number
Cited In (14)
- Improved Bounds for Track Numbers of Planar Graphs
- On families of planar DAGs with constant stack number
- On the queue number of planar graphs
- Graph product structure for non-minor-closed classes
- Lazy queue layouts of posets
- Linear layouts of bipartite planar graphs
- An improved upper bound on the queue number of planar graphs
- The Local Queue Number of Graphs with Bounded Treewidth
- The Rique-number of graphs
- The mixed page number of graphs
- Lazy Queue Layouts of Posets
- Graph product structure for \(h\)-framed graphs
- Queue layouts of graph products and powers
- On mixed linear layouts of series-parallel graphs
This page was built for publication: Queue layouts of planar 3-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918924)