منابع مشابه
On Balloon Drawings of Rooted Trees
Among various styles of tree drawing reported in the literature, balloon drawing enjoys a desirable feature of displaying tree structures in a rather balanced fashion. Each subtree in the balloon drawing of a tree is enclosed in a circle. Along any path from the root node, the radius of each circle reflects the number of descendants associated with the root node of the subtree. In this paper, w...
متن کاملCircular Drawings of Rooted Trees
We describe an algorithm producing circular l a y outs for trees, that is drawings, where subtrees of a node lie within circles, and these circles are themselves placed on the circumference of a circle. The complexity and methodology of our algorithm compares to Reingold and Tilford's algorithm for trees [11]. Moreover, the algorithm naturally admits distortion transformations of the layout. Th...
متن کاملIdeal Drawings of Rooted Trees With Approximately Optimal Width
For rooted trees, an ideal drawing is one that is planar, straight-line, strictly-upward, and order-preserving. This paper considers ideal drawings of rooted trees with the objective of keeping the width of such drawings small. It is not known whether finding the minimum width is NPhard or polynomial. This paper gives a 2-approximation for this problem, and a 2∆-approximation (for ∆-ary trees) ...
متن کامل4-PLACEMENT OF ROOTED TREES
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
متن کاملOptimum-width upward drawings of trees I: Rooted pathwidth
An upward drawing of a rooted tree is a drawing such that no parents are below their children. It is ordered if the edges to children appear in prescribed order around each vertex. It is well-known that any tree has an upward (unordered) drawing with width log(n+ 1). For ordered drawings, the best-known bounds for the width for binary trees is O(logn), while for arbitrary trees it is O(2 √ ). W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2007
ISSN: 1526-1719
DOI: 10.7155/jgaa.00153