Jørgen Bang-Jensen, Anders Yeo. The complexity of multicut and mixed multicut problems in (di)graphs. Theoretical Computer Science, 520:87-96, 2014. [doi]
@article{Bang-JensenY14,
title = {The complexity of multicut and mixed multicut problems in (di)graphs},
author = {Jørgen Bang-Jensen and Anders Yeo},
year = {2014},
doi = {10.1016/j.tcs.2013.10.022},
url = {http://dx.doi.org/10.1016/j.tcs.2013.10.022},
researchr = {https://researchr.org/publication/Bang-JensenY14},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {520},
pages = {87-96},
}