A note on optimal area algorithms for upward drawings of binary trees
Computational Geometry: Theory and Applications
Parallel recognition of series-parallel graphs
Information and Computation
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Drawing Outer-Planar Graphs in O(n log n) Area
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Information Processing Letters
Small area drawings of outerplanar graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Minimum-width grid drawings of plane graphs
Computational Geometry: Theory and Applications
Improved lower bounds on the area requirements of series-parallel graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Small drawings of series-parallel graphs and other subclasses of planar graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Small grid drawings of planar graphs with balanced bipartition
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Small grid drawings of planar graphs with balanced partition
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We show that there exist series-parallel graphs requiring *** (n logn ) area in any straight-line or poly-line grid drawing. Such a result is achieved by proving that, in any straight-line or poly-line drawing of K 2,n , one side of the bounding box has length *** (n ).