3 search results - page 1 / 1 » Parameterized Tractability of Edge-Disjoint Paths on Directe... |
ESA
2003
Springer
13 years 10 months ago
2003
Springer
DAM
2008
13 years 5 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
DISOPT
2011
12 years 12 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...