Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs

Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes UhlmannEur. J. Oper. Res 2008 · OpenReview

Abstract

Multicut is a fundamental network communication and connectivity problem. It 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.
BibTeX
@article{guo2008complexity,
  author = {Jiong Guo and Falk Hüffner and Erhan Kenar and Rolf Niedermeier and Johannes Uhlmann},
  title = {{Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs}},
  journal = {Eur. J. Oper. Res.},
  year = {2008},
  url = {https://openreview.net/forum?id=in4zd3uIZX},
}

Loading related content...

Figure