Drawing (Complete) Binary Tanglegrams
From MaRDI portal
Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Recommendations
- A faster fixed-parameter approach to drawing binary tanglegrams
- Drawing (complete) binary tanglegrams
- Drawing binary tanglegrams: an experimental evaluation
- Untangling circular drawings: algorithms and complexity
- scientific article; zbMATH DE number 219263
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
- Complexity of finding non-planar rectilinear drawings of graphs
- NP-completeness of slope-constrained drawing of complete graphs
- On the \(\mathcal{NP}\)-hardness of \textsc{GRacSim drawing} and \(k\)-SEFE problems
Cited in
(12)- Analogies between the crossing number and the tangle crossing number
- Computing height-optimal tangles faster
- Drawing (complete) binary tanglegrams
- A satisfiability-based approach for embedding generalized tanglegrams on level graphs
- A faster fixed-parameter approach to drawing binary tanglegrams
- On trees, tanglegrams, and tangled chains
- Drawing binary tanglegrams: an experimental evaluation
- The complexity of finding tangles
- Characterizing planar tanglegram layouts and applications to edge insertion problems
- The largest crossing number of tanglegrams
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
- Comparing trees via crossing minimization
This page was built for publication: Drawing (Complete) Binary Tanglegrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611867)
