Lower Bounds on the Area Requirements of Series-Parallel Graphs

We show that there exist series-parallel graphs requiring Omega(n2(root log n)) area in any straight-line or poly-line grid drawing. Such a result is achieved in two steps. First, we show that, in any straight-line or poly-line drawing of K-2,K-n, one side of the bounding box has length Omega(n), thus answering two questions posed by Biedl et al. Second, we show a family of series-parallel graphs requiring Omega(2(root log n)) width and Omega(2(root log n)) height in any straight-line or poly-line grid drawing. Combining the two results, the Omega(n2(root log n)) area lower bound is achieved.


Published in:
Discrete Mathematics And Theoretical Computer Science, 12, 139-174
Year:
2011
Keywords:
Note:
Accepted, subject to revisions
Laboratories:




 Record created 2010-11-26, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)