A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs

DOI10.1007/978-3-642-38016-7_22zbMath1394.68436OpenAlexW1444404417MaRDI QIDQ2848931

Therese C. 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)

Related Items (4)

Optimal-area visibility representations of outer-1-plane graphs ⋮ Drawing Planar Graphs with Reduced Height ⋮ Horton-Strahler number, rooted pathwidth and upward drawings of trees ⋮ Triangulating Planar Graphs While Keeping the Pathwidth Small

This page was built for publication: A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs