Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth

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, 809:239-249, 2020. [doi]

Abstract

Abstract is missing.