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

DOI10.1007/978-3-540-92248-3_15zbMath1202.68276OpenAlexW171848522MaRDI QIDQ5302052

Fabrizio Frati

Publication date: 20 January 2009

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92248-3_15

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs ⋮ Small grid drawings of planar graphs with balanced partition

Cites Work

• Unnamed Item
• Unnamed Item
• How to draw a planar graph on a grid
• Drawing \(K_{2,n}\): A lower bound
• Parallel recognition of series-parallel graphs
• A note on optimal area algorithms for upward drawings of binary trees
• Minimum-width grid drawings of plane graphs
• The Recognition of Series Parallel Digraphs
• HOW TO DRAW A SERIES-PARALLEL DIGRAPH
• PATHWIDTH AND LAYERED DRAWINGS OF TREES
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• Graph Drawing

This page was built for publication: A Lower Bound on the Area Requirements of Series-Parallel Graphs