
Degree Bounded Bottleneck Spanning Trees in Three Dimensions
The geometric δminimum spanning tree problem (δMST) is the problem of ...
read it

Simultaneous Dominating Set for Spanning Tree Factorings
For a connected graph G we call a set F a spanning tree factoring of G i...
read it

On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
The minimum height of vertex and edge partition trees are wellstudied g...
read it

Finding Diverse Trees, Paths, and More
Mathematical modeling is a standard approach to solve many realworld pr...
read it

Preferences SinglePeaked on a Tree: Multiwinner Elections and Structural Results
A preference profile is singlepeaked on a tree if the candidate set can...
read it

On the Complexity of the Bilevel Minimum Spanning Tree Problem
We consider the bilevel minimum spanning tree (BMST) problem where the l...
read it

Covering TreeBased Phylogenetic Networks
Treebased phylogenetic networks, which may be roughly defined as leafl...
read it
Deleting to Structured Trees
We consider a natural variant of the wellknown Feedback Vertex Set problem, namely the problem of deleting a small subset of vertices or edges to a full binary tree. This version of the problem is motivated by realworld scenarios that are best modeled by full binary trees. We establish that both versions of the problem are NPhard, which stands in contrast to the fact that deleting edges to obtain a forest or a tree is equivalent to the problem of finding a minimum cost spanning tree, which can be solved in polynomial time. We also establish that both problems are FPT by the standard parameter.
READ FULL TEXT
Comments
There are no comments yet.