Skip to main content
SpringerLink
Log in

A Lower Bound on the Area Requirements of Series-Parallel Graphs

  • Conference paper
Graph-Theoretic Concepts in Computer Science (WG 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5344))

Included in the following conference series:

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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bertolazzi, P., Cohen, R.F., Di Battista, G., Tamassia, R., Tollis, I.G.: How to draw a series-parallel digraph. Int. J. Comp. Geom. Appl. 4(4), 385–402 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Biedl, T.C.: Drawing outer-planar graphs in O(n logn) area. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 54–65. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. 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)

    Google Scholar 

  4. Biedl, T.C., Chan, T.M., López-Ortiz, A.: Drawing K 2,n : A lower bound. Inf. Process. Lett. 85(6), 303–305 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chrobak, M., Nakano, S.: Minimum-width grid drawings of plane graphs. Comput. Geom. 11(1), 29–54 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Crescenzi, P., Di Battista, G., Piperno, A.: A note on optimal area algorithms for upward drawings of binary trees. Comput. Geom. 2, 187–200 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  7. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  8. Di Battista, G., Frati, F.: Small area drawings of outerplanar graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 89–100. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Dolev, D., Leighton, T., Trickey, H.: Planar embeddings of planar graphs. Advances in Computing Research 2, 147–161 (1984)

    Google Scholar 

  10. Eppstein, D.: Parallel recognition of series-parallel graphs. Inf. Comput. 98(1), 41–55 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  11. Felsner, S., Liotta, G., Wismath, S.K.: Straight-line drawings on restricted integer grids in two and three dimensions. J. Graph Algorithms Appl. 7(4), 363–398 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  12. Schnyder, W.: Embedding planar graphs on the grid. In: Proc. 1st ACM-SIAM Sympos. Discr. Alg., pp. 138–148 (1990)

    Google Scholar 

  13. Suderman, M.: Pathwidth and layered drawings of trees. Int. J. Comp. Geom. Appl. 14(3), 203–225 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  14. Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298–313 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  15. Wagner, K.: Uber eine eigenschaft der ebenen komplexe. Math. Ann. 114, 570–590 (1937)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Automazione, Università di Roma Tre, Italy

    Fabrizio Frati

Authors
  1. Fabrizio Frati
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Durham University, South Road, DH1 3LE, Durham, UK

    Hajo Broersma , Tom Friedetzky  & Daniel Paulusma ,  & 

  2. Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Thomas Erlebach

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frati, F. (2008). A Lower Bound on the Area Requirements of Series-Parallel Graphs. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2008. Lecture Notes in Computer Science, vol 5344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92248-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92248-3_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92247-6

  • Online ISBN: 978-3-540-92248-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation