312 search results - page 1 / 63 » An experimental study on algorithms for drawing binary trees |
APVIS
2006
13 years 6 months ago
2006
JGAA
2008
13 years 4 months ago
2008
ALENEX
2009
13 years 5 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
CCCG
1998
13 years 6 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
IPL
2002
13 years 4 months ago
2002
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...