Laying Out Graphs Using Queues
From MaRDI portal
Publication:4015976
DOI10.1137/0221055zbMATH Open0778.05078OpenAlexW1987216097WikidataQ29041710 ScholiaQ29041710MaRDI QIDQ4015976FDOQ4015976
Authors: Lenwood S. Heath, Arnold L. Rosenberg 
Publication date: 6 December 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0221055
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
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)
Cited In (77)
- Separating layered treewidth and row treewidth
- The queue-number of posets of bounded width or height
- On Layered Fan-Planar Graph Drawings
- Layered separators in minor-closed graph classes with applications
- 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
- Planar graphs of bounded degree have bounded queue number
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Title not available (Why is that?)
- On Mixed Linear Layouts of Series-Parallel Graphs
- Mixed linear layouts of planar graphs
- On the queue number of planar graphs
- Characterisations and examples of graph classes with bounded expansion
- Track layouts, layered path decompositions, and leveled planarity
- Mixed linear layouts: complexity, heuristics, and experiments
- Acyclically 3-colorable planar graphs
- 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
- Title not available (Why is that?)
- Multilevel planarity
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- On the complexity of recognizing Wheeler graphs
- Computing straight-line 3D grid drawings of graphs in linear volume
- On the parameterized complexity of layered graph drawing
- Parameterized algorithms for queue layouts
- An improved upper bound on the queue number of the hypercube
- Improved bounds for track numbers of planar graphs
- Processor-efficient sparse matrix-vector multiplication
- An improved upper bound on the queue number of planar graphs
- The Local Queue Number of Graphs with Bounded Treewidth
- Queue layouts of iterated line directed graphs
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs
- Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number
- 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
- The Rique-number of graphs
- Characterization of unlabeled level planar trees
- Upward three-dimensional grid drawings of graphs
- Plane Drawings of Queue and Deque Graphs
- Graph layouts via layered separators
- The mixed page number of graphs
- Queue layouts of planar 3-trees
- Queue layouts of planar 3-trees
- Parameterized analysis and crossing minimization problems
- Lazy Queue Layouts of Posets
- Curve-constrained drawings of planar graphs
- Planar lattices are lexicographically shellable
- 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
- The pagenumber of \(k\)-trees is \(O(k)\)
- The biplanar tree graph
- Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover
- Two results on layered pathwidth and linear layouts
- Topological graph layouts into a triangular prism
- Track layout is hard
- Linear layouts of bipartite planar graphs
- An approach to emulating separable graphs
- (3,2)-Track Layout of Bipartite Graph Subdivisions
- Characterizing planarity by the splittable deque
- Upward partitioned book embeddings
- Stack and queue layouts of some graph products
- Graph product structure for \(h\)-framed graphs
- Title not available (Why is that?)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
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)
