Sciweavers

7 search results - page 1 / 2
» Drawing (Complete) Binary Tanglegrams
Sort
View
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 6 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
2008
Springer
13 years 6 months ago
Drawing (Complete) Binary Tanglegrams
Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin...
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
14 years 10 days ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
GD
1997
Springer
13 years 9 months ago
Minimum-Area h-v Drawings of Complete Binary Trees
Pierluigi Crescenzi, Paolo Penna