Sciweavers

27 search results - page 1 / 6
» Grid Drawings of Binary Trees: An Experimental Study
Sort
View
JGAA
2008
75views more  JGAA 2008»
13 years 10 months ago
Grid Drawings of Binary Trees: An Experimental Study
Adrian Rusu, Confesor Santiago
APVIS
2006
14 years 5 days ago
An experimental study on algorithms for drawing binary trees
Adrian Rusu, Radu Jianu, Confesor Santiago, Christ...
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 12 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
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...
Martin Nöllenburg, Markus Völker, Alexan...
GD
2007
Springer
14 years 4 months ago
Minimizing the Area for Planar Straight-Line Grid Drawings
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...
Marcus Krug, Dorothea Wagner
CCCG
1998
14 years 3 days ago
Proximity drawings of binary trees in polynomial area
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
Paolo Penna, Paola Vocca