Abstract
We show that there exist series-parallel graphs requiring \(\Omega(n 2^{\sqrt{\log n}})\) area in any straight-line or poly-line grid drawing, improving the previously best known Ω(n logn) lower bound.
This work is partially supported by the Italian Ministry of Research, Grant number RBIP06BZW8, FIRB project “Advanced tracking system in intermodal freight transportation”.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bertolazzi, P., Cohen, R.F., di Battista, G., Tamassia, R., Tollis, I.G.: How to draw a series-parallel digraph. International Journal of Computational Geometry & Applications 4(4), 385–402 (1994)
Biedl, T.C.: Small poly-line drawings of series-parallel graphs. Tech. Report CS-2007-23, School of Computer Science, University of Waterloo, Canada (2005)
Biedl, T.C.: On small drawings of series-parallel graphs and other subclasses of planar graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 280–291. Springer, Heidelberg (2010)
Biedl, T.C., Chan, T.M., López-Ortiz, A.: Drawing K 2,n : A lower bound. Information Processing Letters 85(6), 303–305 (2003)
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)
Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Book embeddability of series-parallel digraphs. Algorithmica 45(4), 531–547 (2006)
Dolev, D., Leighton, T., Trickey, H.: Planar embeddings of planar graphs. Advances in Computing Research 2, 147–161 (1984)
Eppstein, D.: Parallel recognition of series-parallel graphs. Information and Computation 98(1), 41–55 (1992)
Frati, F.: A lower bound on the area requirements of series-parallel graphs. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 159–170. Springer, Heidelberg (2008)
Schnyder, W.: Embedding planar graphs on the grid. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 1990), pp. 138–148 (1990)
Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM Journal on Computing 11(2), 298–313 (1982)
Wood, D.R.: Private Communication (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frati, F. (2011). Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs. In: Brandes, U., Cornelsen, S. (eds) Graph Drawing. GD 2010. Lecture Notes in Computer Science, vol 6502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18469-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-18469-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18468-0
Online ISBN: 978-3-642-18469-7
eBook Packages: Computer ScienceComputer Science (R0)