Laying Out Graphs Using Queues
From MaRDI portal
Publication:4015976
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Applications of graph theory to circuits and networks (94C15) Graph theory (05C99)
Recommendations
- Graph Drawing
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Queue layouts of iterated line directed graphs
- scientific article; zbMATH DE number 431507
- Stack and queue layouts of some graph products
- scientific article; zbMATH DE number 1954397
- Plane Drawings of Queue and Deque Graphs
- Stacks, queues and tracks: layouts of graph subdivisions
- Queue layouts of graph products and powers
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
Cited in
(77)- The pagenumber of \(k\)-trees is \(O(k)\)
- The biplanar tree graph
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
- The queue-number of posets of bounded width or height
- Separating layered treewidth and row treewidth
- A new upper bound on the queuenumber of hypercubes
- Layered separators in minor-closed graph classes with applications
- A note on ``An improved upper bound on the queue number of the hypercube
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
- On Layered Fan-Planar Graph Drawings
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Planar graphs of bounded degree have bounded queue number
- scientific article; zbMATH DE number 2157327 (Why is no real title available?)
- Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover
- Characterisations and examples of graph classes with bounded expansion
- On the queue number of planar graphs
- Track layouts, layered path decompositions, and leveled planarity
- Acyclically 3-colorable planar graphs
- Mixed linear layouts of planar graphs
- On Mixed Linear Layouts of Series-Parallel Graphs
- Two results on layered pathwidth and linear layouts
- Mixed linear layouts: complexity, heuristics, and experiments
- Topological graph layouts into a triangular prism
- Track layout is hard
- Stack and queue number of 2-trees
- Graph classes and forbidden patterns on three vertices
- Layouts of Expander Graphs
- Outer 1-planar graphs
- Lazy queue layouts of posets
- Characterizations of deque and queue graphs
- scientific article; zbMATH DE number 2159644 (Why is no real title available?)
- On the parameterized complexity of layered graph drawing
- On the complexity of recognizing Wheeler graphs
- Computing straight-line 3D grid drawings of graphs in linear volume
- Multilevel planarity
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- An improved upper bound on the queue number of the hypercube
- Parameterized algorithms for queue layouts
- Linear layouts of bipartite planar graphs
- Processor-efficient sparse matrix-vector multiplication
- Improved bounds for track numbers of planar graphs
- Queue layouts of iterated line directed graphs
- An improved upper bound on the queue number of planar graphs
- The Local Queue Number of Graphs with Bounded Treewidth
- Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs
- On the queue-number of the hypercube
- Linear layouts of complete graphs
- On the queue-number of partial orders
- Stack-number is not bounded by queue-number
- Data Structures and their Planar Graph Layouts
- An approach to emulating separable graphs
- The Rique-number of graphs
- Characterization of unlabeled level planar trees
- (3,2)-Track Layout of Bipartite Graph Subdivisions
- Upward three-dimensional grid drawings of graphs
- Graph layouts via layered separators
- Plane Drawings of Queue and Deque Graphs
- The mixed page number of graphs
- Queue layouts of planar 3-trees
- Queue layouts of planar 3-trees
- Characterizing planarity by the splittable deque
- Parameterized analysis and crossing minimization problems
- Upward partitioned book embeddings
- Lazy Queue Layouts of Posets
- Curve-constrained drawings of planar graphs
- Planar lattices are lexicographically shellable
- Stack and queue layouts of some graph products
- Graph product structure for \(h\)-framed graphs
- scientific article; zbMATH DE number 431507 (Why is no real title available?)
- Queue layouts of graph products and powers
- Geometric thickness in a grid
- On mixed linear layouts of series-parallel graphs
- On the queue-number of graphs with bounded tree-width
- Homotopy height, grid-major height and graph-drawing height
- Line and plane cover numbers revisited
- Parameterized Algorithms for Queue Layouts
This page was built for publication: Laying Out Graphs Using Queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4015976)
