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]
@article{Bentz08,
title = {On the complexity of the multicut problem in bounded tree-width graphs and digraphs},
author = {Cédric Bentz},
year = {2008},
doi = {10.1016/j.dam.2007.09.013},
url = {http://dx.doi.org/10.1016/j.dam.2007.09.013},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Bentz08},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {156},
number = {10},
pages = {1908-1917},
}