DeepAI AI Chat
Log In Sign Up

Block Crossings in One-Sided Tanglegrams

by   Alexander Dobler, et al.
TU Wien

Tanglegrams are drawings of two rooted binary phylogenetic trees and a matching between their leaf sets. The trees are drawn crossing-free on opposite sides with their leaf sets facing each other on two vertical lines. Instead of minimizing the number of pairwise edge crossings, we consider the problem of minimizing the number of block crossings, that is, two bundles of lines crossing each other locally. With one tree fixed, the leaves of the second tree can be permuted according to its tree structure. We give a complete picture of the algorithmic complexity of minimizing block crossings in one-sided tanglegrams by showing NP-completeness, constant-factor approximations, and a fixed-parameter algorithm. We also state first results for non-binary trees.


page 1

page 2

page 3

page 4


A Note on the Complexity of One-Sided Crossing Minimization of Trees

In 2011, Harrigan and Healy published a polynomial-time algorithm for on...

Analogies between the crossing number and the tangle crossing number

Tanglegrams are special graphs that consist of a pair of rooted binary t...

A note on the flip distance between non-crossing spanning trees

We consider spanning trees of n points in convex position whose edges ar...

The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs

In the area of graph drawing, the One-Sided Crossing Minimization Proble...

How to Fit a Tree in a Box

We study compact straight-line embeddings of trees. We show that perfect...

Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings

In phylogenetics, tree-based networks are used to model and visualize th...

Computing Storyline Visualizations with Few Block Crossings

Storyline visualizations show the structure of a story, by depicting the...