Abstract
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). © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
APA
Frati, F. (2008). A lower bound on the area requirements of series-parallel graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5344 LNCS, pp. 159–170). https://doi.org/10.1007/978-3-540-92248-3_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free