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

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 (fixedparameter) tractability results for restricted classes of graphs such as trees, interval graphs, and graphs of bounded treewidth. Key words: Combinatorial optimization, Complexity theory, NP-completeness, Dynamic programming, Graph theory, Parameterized complexity

• Type: Journal
• Year: 2008
• Where: EOR
• Authors: Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann
• Keywords: Connectivity Problem, EOR 2008, Fundamental Network Communication, Terminal Vertices