Laying Out Graphs Using Queues
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
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
(94)- Planar lattices are lexicographically shellable
- Geometric thickness in a grid
- The queue-number of posets of bounded width or height
- Track layouts, layered path decompositions, and leveled planarity
- Processor-efficient sparse matrix-vector multiplication
- On mixed linear layouts of series-parallel graphs
- On the complexity of recognizing Wheeler graphs
- Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number
- Stack-number is not bounded by queue-number
- On the queue-number of partial orders
- Linear layouts of complete graphs
- On the queue number of planar graphs
- The mixed page number of graphs
- Parameterized analysis and crossing minimization problems
- Line and plane cover numbers revisited
- Mixed linear layouts: complexity, heuristics, and experiments
- Homotopy height, grid-major height and graph-drawing height
- The biplanar tree graph
- An improved upper bound on the queue number of the hypercube
- Computing straight-line 3D grid drawings of graphs in linear volume
- Layered separators in minor-closed graph classes with applications
- Upward three-dimensional grid drawings of graphs
- An improved upper bound on the queue number of planar graphs
- Lazy queue layouts of posets
- On the queue-number of the hypercube
- Characterizing planarity by the splittable deque
- Outer 1-planar graphs
- Topological graph layouts into a triangular prism
- Track layout is hard
- Stack and queue layouts of some graph products
- Plane Drawings of Queue and Deque Graphs
- Characterizations of deque and queue graphs
- scientific article; zbMATH DE number 431507 (Why is no real title available?)
- Layouts of Expander Graphs
- 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
- An approach to emulating separable graphs
- Mixed linear layouts of planar graphs
- Upward partitioned book embeddings
- Data Structures and their Planar Graph Layouts
- scientific article; zbMATH DE number 2159644 (Why is no real title available?)
- scientific article; zbMATH DE number 2157327 (Why is no real title available?)
- Graph layouts via layered separators
- The Local Queue Number of Graphs with Bounded Treewidth
- Parameterized Algorithms for Queue Layouts
- Lazy Queue Layouts of Posets
- On Mixed Linear Layouts of Series-Parallel Graphs
- Parameterized algorithms for queue layouts
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs
- On Layered Fan-Planar Graph Drawings
- Improved bounds for track numbers of planar graphs
- Two results on layered pathwidth and linear layouts
- On the queue-number of graphs with bounded tree-width
- Planar graphs of bounded degree have bounded queue number
- (3,2)-Track Layout of Bipartite Graph Subdivisions
- Queue layouts of graph products and powers
- Graph classes and forbidden patterns on three vertices
- Multilevel planarity
- Queue layouts of planar 3-trees
- Queue layouts of planar 3-trees
- The pagenumber of k-trees is O(k)
- Separating layered treewidth and row treewidth
- Stack and queue number of 2-trees
- The Rique-number of graphs
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
- Linear layouts of bipartite planar graphs
- 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
- Graph product structure for \(h\)-framed graphs
- Weakly leveled planarity with bounded span
- Pathwidth of 2-layer k-planar graphs
- Directed acyclic outerplanar graphs have constant stack number
- An improved upper bound on the queue number of the folded hypercube
- Constrained level planarity is FPT with respect to the vertex cover number
- Deques on a torus
- Weakly leveled planarity with bounded span
- Stack and queue numbers of graphs revisited
- Acyclically 3-colorable planar graphs
- Queue layouts on folded hypercubes
- Stack and queue numbers of graphs revisited
- Curve-constrained drawings of planar graphs
- Forbidden patterns in mixed linear layouts
- Transforming stacks into queues: mixed and separated layouts of graphs
- The peculiarities of extending queue layouts
- Linear layouts of graphs with priority queues
- Linear layouts revisited: stacks, queues, and exact algorithms
- Defective linear layouts of graphs (poster abstract)
- Queue layouts of iterated line directed graphs
- Characterization of unlabeled level planar trees
- On the parameterized complexity of layered graph drawing
- A new upper bound on the queuenumber of hypercubes
- 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
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)
