Graph Drawing
DOI10.1007/11618058zbMATH Open1171.68652OpenAlexW4251892597MaRDI QIDQ5897653FDOQ5897653
Authors: Huaming Zhang, Xin He 
Publication date: 13 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11618058
Recommendations
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
- scientific article; zbMATH DE number 1974132
- Canonical ordering trees and their applications in graph drawing
- Orderly spanning trees with applications to graph encoding and graph drawing
- Area-efficient order-preserving planar straight-line drawings of ordered trees
- AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
- Drawing Ordered (k − 1)–Ary Trees on k–Grids
- Order-preserving drawings of trees with approximately optimal height (and small width)
- Orderly Spanning Trees with Applications
- Drawing unordered trees on \(k\)-grids
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (6)
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
- Visibility representations of four-connected plane graphs with near optimal heights
- Title not available (Why is that?)
- Strictly-upward drawings of ordered search trees
- Compact visibility representation of 4-connected plane graphs
- Drawing Ordered (k − 1)–Ary Trees on k–Grids
This page was built for publication: Graph Drawing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897653)
