Nearly optimal monotone drawing of trees

DOI10.1016/j.tcs.2016.01.009zbMath1353.68212OpenAlexW2260278159MaRDI QIDQ344763

Dayu He, Xin He

Publication date: 24 November 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.009

zbMATH Keywords

treesmonotone drawingsprimitive vectors

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Rooted Uniform Monotone Minimum Spanning Trees ⋮ Optimal Monotone Drawings of Trees ⋮ Simple Compact Monotone Tree Drawings ⋮ Monotone drawings of \(k\)-inner planar graphs

Cites Work

• Algorithms for plane representations of acyclic digraphs
• On a conjecture related to geometric routing
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• On Monotone Drawings of Trees
• Monotone Grid Drawings of Planar Graphs
• Compact Monotone Drawing of Trees
• Monotone Drawings of Graphs with Fixed Embedding
• Monotone Drawings of Graphs
• An Algorithm to Construct Greedy Drawings of Triangulations

This page was built for publication: Nearly optimal monotone drawing of trees