https://hal.archives-ouvertes.fr/hal-01126374
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 11:52:42 AM Last modification on : Friday, August 21, 2020 - 1:56:05 PM
Cédric Bentz. On the complexity of the multicut problem in bounded tree-width graphs and digraphs. Discrete Applied Mathematics, Elsevier, 2008, 156, pp.1908-1917. ⟨hal-01126374⟩