Comparing Queues and Stacks As Machines for Laying Out Graphs
From MaRDI portal
Recommendations
- Laying Out Graphs Using Queues
- scientific article; zbMATH DE number 431507
- Stack and queue layouts of some graph products
- Stacks, queues and tracks: layouts of graph subdivisions
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II
- Graph Drawing
- Queue layouts of iterated line directed graphs
Cited in
(77)- The queue-number of posets of bounded width or height
- Processor-efficient sparse matrix-vector multiplication
- Notes on graph product structure theory
- On mixed linear layouts of series-parallel graphs
- On off-diagonal ordered Ramsey numbers of nested matchings
- On dispersability of some products of cycles
- 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
- Mixed linear layouts: complexity, heuristics, and experiments
- The biplanar tree graph
- Book embedding of complex network with community structure
- 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
- A fast algorithm for the product structure of planar graphs
- An improved upper bound on the queue number of planar graphs
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Lazy queue layouts of posets
- On the queue-number of the hypercube
- Queue layouts of hypercubes
- Topological graph layouts into a triangular prism
- Stack and queue layouts of some graph products
- Characterizations of deque and queue graphs
- scientific article; zbMATH DE number 431507 (Why is no real title available?)
- On the page number of upward planar directed acyclic graphs
- Layouts of Expander Graphs
- Laying Out Graphs Using Queues
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II
- 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?)
- 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
- Upward book embeddings of st-graphs
- Graph Drawing
- 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
- Stacks, queues and tracks: layouts of graph subdivisions
- Graph classes and forbidden patterns on three vertices
- Queue layouts of planar 3-trees
- Queue layouts of planar 3-trees
- On the upward book thickness problem: combinatorial and complexity results
- Separating layered treewidth and row treewidth
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- The Rique-number of graphs
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
- Graph product structure for non-minor-closed classes
- Linear layouts of bipartite planar graphs
- Using Euler’s Formula to Find the Lower Bound of the Page Number
- On off-diagonal ordered Ramsey numbers of nested matchings
- 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
- Directed acyclic outerplanar graphs have constant stack number
- An improved upper bound on the queue number of the folded hypercube
- 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
- Transforming stacks into queues: mixed and separated layouts of graphs
- Linear layouts of graphs with priority queues
- Queue layouts of iterated line directed graphs
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- A new upper bound on the queuenumber of hypercubes
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
This page was built for publication: Comparing Queues and Stacks As Machines for Laying Out Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018851)
