scientific article; zbMATH DE number 1974107

zbMath1037.68565MaRDI QIDQ4422262

Therese C. Biedl

Publication date: 3 September 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2528/25280054.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

A Lower Bound on the Area Requirements of Series-Parallel Graphs ⋮ Drawing outer-1-planar graphs revisited ⋮ Area-efficient planar straight-line drawings of outerplanar graphs ⋮ Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs ⋮ Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area ⋮ Small grid drawings of planar graphs with balanced partition ⋮ Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract) ⋮ Small area drawings of outerplanar graphs

This page was built for publication: