A faster fixed-parameter approach to drawing binary tanglegrams

DOI10.1007/978-3-642-11269-0_3MaRDI QIDQ3656849zbMATH OpenOpenAlexFDO

Authors Sebastian Böcker, Falk Hüffner, Magnus Wahlström, 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)

Recommendations

• Drawing (Complete) Binary Tanglegrams
• Drawing (complete) binary tanglegrams
• Drawing binary tanglegrams: an experimental evaluation
• Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
• Analogies between the crossing number and the tangle crossing number

Cites work

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

Cited in

(13)

• An infinite antichain of planar tanglegrams
• Some problems related to the space of optimal tree reconciliations (invited talk)
• Drawing (complete) binary tanglegrams
• Satisfying more than half of a system of linear equations over GF(2): a multivariate approach
• Drawing (Complete) Binary Tanglegrams
• A note on the parameterized complexity of unordered maximum tree orientation
• Drawing binary tanglegrams: an experimental evaluation
• Compression via matroids: a randomized polynomial kernel for odd cycle transversal
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Block crossings in one-sided tanglegrams
• The largest crossing number of tanglegrams
• Block crossings in one-sided tanglegrams
• Comparing trees via crossing minimization

This page was built for publication: A faster fixed-parameter approach to drawing binary tanglegrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3656849)