DISOPT
2011
13 years 7 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
LATIN
2010
Springer
14 years 7 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...