Minimum-layer drawings of trees (extended abstract)
From MaRDI portal
Publication:3078403
DOI10.1007/978-3-642-19094-0_23zbMATH Open1317.68136OpenAlexW1305143MaRDI QIDQ3078403FDOQ3078403
Authors: Debajyoti Mondal, Md. Jawaherul Alam, Md. Saidur Rahman 
Publication date: 20 February 2011
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19094-0_23
Recommendations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- PATHWIDTH AND LAYERED DRAWINGS OF TREES
- Title not available (Why is that?)
- Drawing Graphs on Two and Three Lines
- Minimum-layer upward drawings of trees
- NP-Completeness of Minimal Width Unordered Tree Layout
Cited In (14)
- Upward Drawings of Trees on the Minimum Number of Layers
- PATHWIDTH AND LAYERED DRAWINGS OF TREES
- On the approximability of two tree drawing conventions
- On upward drawings of trees on a given grid
- Drawing Planar Graphs with Reduced Height
- ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS
- Minimum-layer upward drawings of trees
- On the 3-tree core of plane graphs
- Order-preserving drawings of trees with approximately optimal height (and small width)
- Horton-Strahler number, rooted pathwidth and upward drawings of trees
- Proximity drawings of high-degree trees
- Minimum height drawings of ordered trees in polynomial time: homotopy height of tree duals
- Drawing a tree on parallel lines
- Three-Dimensional Drawings of Bounded Degree Trees
This page was built for publication: Minimum-layer drawings of trees (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3078403)
