Computing β-Drawings of 2-Outerplane Graphs in Linear Time

DOI10.1007/978-3-540-77891-2_8MaRDI QIDQ5452155zbMATH OpenOpenAlexFDO

Authors M.D. Abul Hassan Samee, Mohammad T. Irfan, Md. Saidur Rahman

Publication date 25 March 2008

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77891-2_8

zbMATH Keywords

\(\beta \)-Drawing2-Outerplane graphGood Slicing PathGraph DrawingProximity DrawingProximity GraphSlicing Path

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
• Planar rectilinear drawings of outerplanar graphs in linear time
• Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
• scientific article; zbMATH DE number 1974107
• Area-efficient planar straight-line drawings of outerplanar graphs
• Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)
• Graph Drawing
• A 2-approximation for the height of maximal outerplanar graph drawings
• The Complexity of Drawing Graphs on Few Lines and Few Planes
• The complexity of drawing graphs on few lines and few planes

Cites work

• Characterizing proximity trees
• Handbook of graph drawing and visualization

Cited in

(4)

• Approximate proximity drawings
• Planar rectilinear drawings of outerplanar graphs in linear time
• The approximate rectangle of influence drawability problem
• Polynomial area bounds for MST embeddings of trees

This page was built for publication: Computing β-Drawings of 2-Outerplane Graphs in Linear Time

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