Complexity and exact algorithms for multicut

Authors:
Jiong Guo;Falk Hüffner;Erhan Kenar;Rolf Niedermeier;Johannes Uhlmann
Affiliations:
Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Tübingen, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Tübingen, Germany
Venue:
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Year:
2006

Citing 6
Cited 5

Evolutionary trees: An integer multicommodity max-flow-min-cut theorem

Advances in Applied Mathematics
The Complexity of Multiterminal Cuts

SIAM Journal on Computing
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

Journal of Algorithms
Fixed-parameter tractability and data reduction for multicut in trees

Networks
Exact algorithms and applications for Tree-like Weighted Set Cover

Journal of Discrete Algorithms
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

A logical approach to multicut problems

Information Processing Letters
On the complexity of the multicut problem in bounded tree-width graphs and digraphs

Discrete Applied Mathematics
Almost 2-SAT is fixed-parameter tractable

Journal of Computer and System Sciences
Algorithms for multiterminal cuts

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Multicut is FPT

Proceedings of the forty-third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

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.