Three dimensional circuit layouts
SIAM Journal on Computing
Convex drawings of graphs in two and three dimensions (preliminary version)
Proceedings of the twelfth annual symposium on Computational geometry
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
3D straight-line grid drawing of 4-colorable graphs
Information Processing Letters
All structured programs have small tree width and good register allocation
Information and Computation
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Drawing graphs
Embeddings of k-Connected Graphs of Pathwidth k
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Fast Interactive 3-D Graph Visualization
GD '95 Proceedings of the Symposium on Graph Drawing
A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs
GD '95 Proceedings of the Symposium on Graph Drawing
Drawing Stressed Planar Graphs in Three Dimensions
GD '95 Proceedings of the Symposium on Graph Drawing
3D Graph Drawing with Simulated Annealing
GD '95 Proceedings of the Symposium on Graph Drawing
Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
An Algorithm for Finding Three Dimensional Symmetry in Trees
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Drawing Graphs Symmetrically in Three Dimensions
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Crossing-Critical Graphs and Path-Width
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Drawing with Colors (Extended Abstract)
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
On the Parameterized Complexity of Layered Graph Drawing
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Three-dimensional Grid Drawings of Graphs
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Parameterized Complexity
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Linkless symmetric drawings of series parallel digraphs
Computational Geometry: Theory and Applications
Grid drawings of k-colourable graphs
Computational Geometry: Theory and Applications
Computing straight-line 3D grid drawings of graphs in linear volume
Computational Geometry: Theory and Applications
Computing straight-line 3D grid drawings of graphs in linear volume
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line grid drawing with O(pw(G)2驴n) volume. Thus for graphs with bounded path-width the volume is O(n), and it follows that for graphs with bounded tree-width, such as series-parallel graphs, the volume is O(n log2 n). No better bound than O(n2) was previously known for drawings of series-parallel graphs. For planar graphs we obtain three-dimensional drawings with O(n2) volume and O(驴n) aspect ratio, whereas all previous constructions with O(n2) volume have 驴(n) aspect ratio.