Compact monotone drawing of trees

DOI10.1007/978-3-319-21398-9_36MaRDI QIDQ3196406zbMATH OpenOpenAlexFDO

Authors Xin He, Dayu He

Publication date 29 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-21398-9_36

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• Nearly optimal monotone drawing of trees
• Optimal monotone drawings of trees
• Simple compact monotone tree drawings
• On monotone drawings of trees
• Monotone drawings of graphs

Cites work

• Algorithms for plane representations of acyclic digraphs
• An Algorithm to Construct Greedy Drawings of Triangulations
• Monotone drawings of graphs
• Monotone grid drawings of planar graphs
• On a conjecture related to geometric routing
• On monotone drawings of trees
• On the computational complexity of upward and rectilinear planarity testing
• Some results on greedy embeddings in metric spaces

Cited in

(9)

• Monotone drawings of k-inner planar graphs
• Voronoi drawings of trees
• Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree
• On monotone drawings of trees
• Low Ply Drawings of Trees
• Nearly optimal monotone drawing of trees
• Simple compact monotone tree drawings
• scientific article; zbMATH DE number 2087456 (Why is no real title available?)
• Optimal monotone drawings of trees

This page was built for publication: Compact monotone drawing of trees

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