Abstract
The MuLTICUT problem is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimum set of edges or vertices whose removal disconnects each pair. We mainly focus on the case of removing vertices, where we distinguish between allowing or disallowing the removal of terminal vertices. Complementing and refining previous results from the literature, we provide several NP-completeness and (fixed-parameter) tractability results for restricted classes of graphs such as trees, interval graphs, and graphs of bounded treewidth. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Guo, J., Hüffner, F., Kenar, E., Niedermeier, R., & Uhlmann, J. (2006). Complexity and exact algorithms for multicut. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3831 LNCS, pp. 303–312). Springer Verlag. https://doi.org/10.1007/11611257_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
