On the complexity of the multicut problem in bounded tree-width graphs and digraphs

Cédric Bentz. On the complexity of the multicut problem in bounded tree-width graphs and digraphs. Discrete Applied Mathematics, 156(10):1908-1917, 2008. [doi]

Abstract

Abstract is missing.