A 4-approximation for the height of drawing 2-connected outer-planar graphs

DOI10.1007/978-3-642-38016-7_22MaRDI QIDQ2848931zbMATH OpenOpenAlexFDO

Authors Therese Biedl

Publication date 13 September 2013

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38016-7_22

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• A 2-approximation for the height of maximal outerplanar graph drawings
• 2-connecting outerplanar graphs without blowing up the pathwidth
• scientific article; zbMATH DE number 1500679
• Grid drawings of 4-connected plane graphs
• Area-efficient planar straight-line drawings of outerplanar graphs

Cited in

(8)

• Horton-Strahler number, rooted pathwidth and upward drawings of trees
• Optimal-area visibility representations of outer-1-plane graphs
• A 2-approximation for the height of maximal outerplanar graph drawings
• Triangulating planar graphs while keeping the pathwidth small
• scientific article; zbMATH DE number 6004935 (Why is no real title available?)
• 2-connecting outerplanar graphs without blowing up the pathwidth
• Drawing Halin-graphs with small height
• Drawing Planar Graphs with Reduced Height

This page was built for publication: A 4-approximation for the height of drawing 2-connected outer-planar graphs

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