Sciweavers

3 search results - page 1 / 1
» Parameterized Tractability of Edge-Disjoint Paths on Directe...
Sort
View
DAM
2008
108views more  DAM 2008»
13 years 5 months ago
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
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...
Cédric Bentz
DISOPT
2011
240views Education» more  DISOPT 2011»
13 years 8 days ago
On the directed Full Degree Spanning Tree problem
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...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...