Article Dans Une Revue Theoretical Computer Science Année : 2019

On the parameterized complexity of separating certain sources from the target

Résumé

multicut is proven to be FPT parameterized by the size of the cutset p. We focus on its generalization partial multicut setting the number of pairs of terminals to be separated as a parameter r: it asks for the minimum edge/vertex cut whose removal would separate r sources si from their target ti. Our main contributions concern its single target subproblem, partial one-target cut (potc). We show that potc, when edges are to be cut, is FPT parameterized by the cutset size p but is W[1]-hard when parameterized only with r. The vertex-cutting version of potc is W[1]-hard regardless of parameter configurations involving r and p.

Dates et versions

hal-02343987 , version 1 (03-11-2019)

Identifiants

Citer

Pierre Bergé, Arpad Rimmel, Joanna Tomasik. On the parameterized complexity of separating certain sources from the target. Theoretical Computer Science, 2019, 795, pp.183-193. ⟨10.1016/j.tcs.2019.06.011⟩. ⟨hal-02343987⟩
231 Consultations
0 Téléchargements

Altmetric

Partager

  • More