A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams

DOI10.1007/978-3-642-11269-0_3zbMath1273.68157OpenAlexW1600949489MaRDI QIDQ3656849

Magnus Wahlström, Sebastian Böcker, Falk Hüffner, Anke Truss

Publication date: 14 January 2010

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Genetics and epigenetics (92D10)

Related Items (9)

An infinite antichain of planar tanglegrams ⋮ Satisfying more than half of a system of linear equations over GF(2): a multivariate approach ⋮ Some problems related to the space of optimal tree reconciliations (invited talk) ⋮ Drawing (complete) binary tanglegrams ⋮ Block crossings in one-sided tanglegrams ⋮ The largest crossing number of tanglegrams ⋮ A note on the parameterized complexity of unordered maximum tree orientation ⋮ Visualizing co-phylogenetic reconciliations ⋮ Unnamed Item

Cites Work

• Weakly bipartite graphs and the max-cut problem
• Drawing (Complete) Binary Tanglegrams
• Drawing Binary Tanglegrams: An Experimental Evaluation
• Optimal Edge Deletions for Signed Graph Balancing
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams