Drawing Ordered (k − 1)–Ary Trees on k–Grids

DOI10.1007/978-3-642-18469-7_10zbMath1314.68219OpenAlexW1528816220MaRDI QIDQ3073664

Marco Matzeder, Wolfgang Brunner

Publication date: 11 February 2011

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18469-7_10

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Upward Planar Drawings with Three and More Slopes ⋮ Upward planar drawings with three and more slopes ⋮ Upward planar drawings with two slopes ⋮ On Upward Drawings of Trees on a Given Grid

This page was built for publication: Drawing Ordered (k − 1)–Ary Trees on k–Grids