Drawing (Complete) Binary Tanglegrams

DOI10.1007/978-3-642-00219-9_32zbMath1213.68431OpenAlexW1895301010MaRDI QIDQ3611867

Maike Buchin, Jaroslaw Byrka, Alexander Wolff, Rodrigo I. Silveira, Martin Nöllenburg, Kevin Buchin, Yoshio Okamoto

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_32

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

Characterizing planar tanglegram layouts and applications to edge insertion problems ⋮ Drawing (complete) binary tanglegrams ⋮ A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs ⋮ Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation ⋮ Comparing trees via crossing minimization ⋮ Unnamed Item ⋮ A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams

This page was built for publication: Drawing (Complete) Binary Tanglegrams