Conference ProceedingsOPEN ACCESS

Improved lower bounds on the area requirements of series-parallel graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6502 LNCS 220-225
DOI: 10.1007/978-3-642-18469-7_20
2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show that there exist series-parallel graphs requiring Ω(n2 √log n) area in any straight-line or poly-line grid drawing, improving the previously best known Ω(n log n) lower bound. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Frati, F. (2011). Improved lower bounds 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. 6502 LNCS, pp. 220–225). https://doi.org/10.1007/978-3-642-18469-7_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free