... binary TL is our motivation to investigate the complexity of complete binary TL. It turns out that even this special case is hard. Unlike Fernau et al. [7] who show hardness of binary TL by ... Drawing (Complete) Binary Tanglegrams 329.
... binary tanglegrams : algorithms and applications . In : Rajasekaran , S. ( ed . ) BICOB 2009. LNCS , vol . 5462 , pp ... ( complete ) binary tanglegrams . Algorithmica 62 ( 1–2 ) , 309–332 ( 2012 ) 5. Calamoneri , T. , Di Donato , V ...
... Tanglegram Layout problem from O(cknO(1)) with c≈ 1024 [4] to O(2kn4), where k is the minimum number of crossings in a drawing, we managed to make fixed-parameter algorithms applicable for sizes that are interesting for visualization ...
... tanglegram drawing of size n for which the optimal drawing produced by seesawing has ( n2 ) more crossings than an optimal drawing . We call a drawing that can't be improved by seesawing seesaw - optimal . We prove the theorem ( in [ 28 ] ...
... Drawing ( Complete ) binary tanglegrams . Algorithmica 62 ( 1 ) , 309-332 ( 2012 ) 8. Chimani , M. , Hungerländer , P. , Jünger , M. , Mutzel , P .: An SDP approach to multi - level crossing minimization . In : Müller - Hannemann , M ...
... Drawing ( Complete ) Binary Tanglegrams : Hardness , Approximation , Fixed - Parameter Tractability . In : Graph Drawing ( 2008 ) 3. Dietz , P.F .: Optimal algorithms for list indexing and subset rank . In : Dehne , F. , Santoro , N ...
... Drawing (complete) binary tanglegrams. Algorithmica 62(1–2), 309–332 (2012). https://doi.org/10.1007/s00453-010-9456-3 6. Calamoneri, T., Monti, A., Sinaimeri, B.: Co-divergence and tree topology. J. Math. Biol. 79(3), 1149–1167 (2019) ...
... drawing tanglegrams with non - binary trees . Fernau et al . [ 5 ] showed the NP - hardness of tanglegram layout ... complete binary trees with n leaves each , this gives rise to 2 ( n - 1 ) variables . If x1 = 1 , the subtree ...
... binary tanglegrams. References. 1. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the ... Drawing (complete) binary tanglegrams: Hardness, approximation, fixed- parameter tractability. In: Tollis, I.G. ...
... drawing Γ of G with ww(Γ) = k⋆ and xΓ (a) = ξ A (a) for each a ∈ A that also produces a corresponding solution ... (complete) binary tanglegrams. Algorithmica 62(1–2), 309–332 (2012). https://doi.org/10.1007/s00453-010-9456-3 2 ...