Cédric Bentz, Pierre Le Bodic. Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth.
Theoretical Computer Science, Elsevier, 2020, 809, pp.239-249.
⟨10.1016/j.tcs.2019.12.015⟩.
⟨hal-02444300⟩