scientific article; zbMATH DE number 1974107

MaRDI QIDQ4422262zbMATH OpenFDO

Authors Therese Biedl

Publication date 3 September 2003

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

Mathematics Subject Classification ID

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

Recommendations

• Graph Drawing
• Area-efficient planar straight-line drawings of outerplanar graphs
• Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
• Small area drawings of outerplanar graphs
• Graph Drawing

Cited in

(19)

• Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)
• Small grid drawings of planar graphs with balanced partition
• Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
• Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
• Complexity measures for mosaic drawings
• Graph Drawing
• Graph Drawing
• Small area drawings of outerplanar graphs
• One-bend drawings of outerplanar graphs inside simple polygons
• Area-efficient planar straight-line drawings of outerplanar graphs
• A Lower Bound on the Area Requirements of Series-Parallel Graphs
• Drawing outer-1-planar graphs revisited
• Drawing outer-1-planar graphs revisited
• Correction to: ``Outer 1-planar graphs
• On Area-Optimal Planar Graph Drawings
• Planar rectilinear drawings of outerplanar graphs in linear time
• Computing β-Drawings of 2-Outerplane Graphs in Linear Time
• Area requirement of graph drawings with few crossings per edge
• Straight-line grid drawings of label-constrained outerplanar graphs with \(O(n \log n)\) area

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4422262)