PATHWIDTH AND LAYERED DRAWINGS OF TREES
From MaRDI portal
Publication:4652929
DOI10.1142/S0218195904001433zbMath1080.68087MaRDI QIDQ4652929
Publication date: 28 February 2005
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Drawing Halin-graphs with small height, A Lower Bound on the Area Requirements of Series-Parallel Graphs, PROXIMITY DRAWINGS OF HIGH-DEGREE TREES, Graph drawings with few slopes, Convergence of Newton's method over commutative semirings, Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs, 2-Layer Graph Drawings with Bounded Pathwidth, Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area, Anagram-free graph colouring, On the parameterized complexity of layered graph drawing, \(k\)-spine, 1-bend planarity, Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem, Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width), Drawing Planar Graphs with Reduced Height, Minimum-Layer Drawings of Trees, 2-connecting outerplanar graphs without blowing up the pathwidth, On Layered Fan-Planar Graph Drawings, Horton-Strahler number, rooted pathwidth and upward drawings of trees, Triangulating Planar Graphs While Keeping the Pathwidth Small, On the stab number of rectangle intersection graphs
Cites Work
