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

Authors:
Fabrizio Frati
Affiliations:
Dipartimento di Informatica e Automazione, Università Roma Tre
Venue:
GD'10 Proceedings of the 18th international conference on Graph drawing
Year:
2010

Citing 6
Cited 0

Parallel recognition of series-parallel graphs

Information and Computation
Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Drawing K2,n: a lower bound

Information Processing Letters
Book Embeddability of Series–Parallel Digraphs

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

Graph-Theoretic Concepts in Computer Science
Small drawings of series-parallel graphs and other subclasses of planar graphs

GD'09 Proceedings of the 17th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

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.