Computing straight-line 3D grid drawings of graphs in linear volume
From MaRDI portal
Recommendations
Cites work
- 3D straight-line grid drawing of 4-colorable graphs
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Computational Geometry in C
- Computing straight-line 3D grid drawings of graphs in linear volume
- Constrained Steiner trees in Halin graphs
- Drawing graphs. Methods and models
- Drawing with colors
- Graph Drawing
- Graph Drawing
- Graph Drawing
- Graph Drawing
- Graph drawing software
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 1954397 (Why is no real title available?)
- scientific article; zbMATH DE number 1974105 (Why is no real title available?)
- scientific article; zbMATH DE number 1974106 (Why is no real title available?)
- scientific article; zbMATH DE number 2145229 (Why is no real title available?)
- scientific article; zbMATH DE number 2159655 (Why is no real title available?)
- scientific article; zbMATH DE number 3346402 (Why is no real title available?)
- Laying Out Graphs Using Queues
- Layout of Graphs with Bounded Tree-Width
- Minimum cycle bases of Halin graphs
- On tree-partitions of graphs
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
- The vertex-face total chromatic number of Halin graphs
- Three-dimensional graph drawing
- Tree-partitions of k-trees with applications in graph layout.
Cited in
(28)- Volume requirements of 3D upward drawings
- On tree-partition-width
- Computing straight-line 3D grid drawings of graphs in linear volume
- Area requirement of graph drawings with few crossings per edge
- Upward three-dimensional grid drawings of graphs
- 3D straight-line grid drawing of 4-colorable graphs
- scientific article; zbMATH DE number 2084287 (Why is no real title available?)
- scientific article; zbMATH DE number 1974106 (Why is no real title available?)
- scientific article; zbMATH DE number 2145229 (Why is no real title available?)
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- Parameterized Algorithms for Queue Layouts
- Parameterized algorithms for queue layouts
- Improved bounds for track numbers of planar graphs
- Equilateral spherical drawings of planar Cayley graphs
- On the queue-number of graphs with bounded tree-width
- Planar graphs of bounded degree have bounded queue number
- Squigraphs for Fine and Compact Modeling of 3-D Shapes
- Graph Drawing
- Queue layouts of planar 3-trees
- On the upward book thickness problem: combinatorial and complexity results
- Tree-partitions with bounded degree trees
- Product structure of graph classes with bounded treewidth
- Product structure of graph classes with strongly sublinear separators
- Bounds on the edge-length ratio of 2-outerplanar graphs
- On the parameterized complexity of computing tree-partitions
- On the parameterized complexity of computing tree-partitions
- Linear layouts of graphs with priority queues
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
This page was built for publication: Computing straight-line 3D grid drawings of graphs in linear volume
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387202)
