Drawing (Complete) Binary Tanglegrams
From MaRDI portal
Publication:3611867
DOI10.1007/978-3-642-00219-9_32zbMath1213.68431MaRDI QIDQ3611867
Jaroslaw Byrka, Yoshio Okamoto, Kevin Buchin, Maike Buchin, Martin Nöllenburg, Alexander Wolff, Rodrigo I. Silveira
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
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Comparing trees via crossing minimization, A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs, A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
