Treewidth of display graphs: bounds, brambles and applications

by   Remie Janssen, et al.

Phylogenetic trees and networks are leaf-labelled graphs used to model evolution. Display graphs are created by identifying common leaf labels in two or more phylogenetic trees or networks. The treewidth of such graphs is bounded as a function of many common dissimilarity measures between phylogenetic trees and this has been leveraged in fixed parameter tractability results. Here we further elucidate the properties of display graphs and their interaction with treewidth. We show that it is NP-hard to recognize display graphs, but that display graphs of bounded treewidth can be recognized in linear time. Next we show that if a phylogenetic network displays (i.e. topologically embeds) a phylogenetic tree, the treewidth of their display graph is bounded by a function of the treewidth of the original network (and also by various other parameters). In fact, using a bramble argument we show that this treewidth bound is sharp up to an additive term of 1. We leverage this bound to give an FPT algorithm, parameterized by treewidth, for determining whether a network displays a tree, which is an intensively-studied problem in the field. We conclude with a discussion on the future use of display graphs and treewidth in phylogenetics.


The size Ramsey number of graphs with bounded treewidth

A graph G is Ramsey for a graph H if every 2-colouring of the edges of G...

Snakes and Ladders: a Treewidth Story

Let G be an undirected graph. We say that G contains a ladder of length ...

First Order Logic on Pathwidth Revisited Again

Courcelle's celebrated theorem states that all MSO-expressible propertie...

A Short Note on Parameterized Computation of Network Reliability with respect to Treewidth

We consider the classic problem of network reliability. A network is giv...

Advances in Learning Bayesian Networks of Bounded Treewidth

This work presents novel algorithms for learning Bayesian network struct...

Computational Complexity of Hedonic Games on Sparse Graphs

The additively separable hedonic game (ASHG) is a model of coalition for...

The treewidth and pathwidth of graph unions

For two graphs G_1 and G_2 on the same vertex set [n]:={1,2, …, n}, and ...

Please sign up or login with your details

Forgot password? Click here to reset