The Complexity of Multiterminal Cuts
SIAM Journal on Computing
The planar multiterminal cut problem
Discrete Applied Mathematics
A simple algorithm for the planar multiway cut problem
Journal of Algorithms
Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract)
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms
Tightening non-simple paths and cycles on surfaces
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Discrete Applied Mathematics
Note: A simple algorithm for multicuts in planar graphs with outer terminals
Discrete Applied Mathematics
A polynomial-time approximation scheme for planar multiway cut
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Revisiting a simple algorithm for the planar multiterminal cut problem
Operations Research Letters
Solving planar k-terminal cut in O(nc√k) time
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A tight lower bound for planar multiway cut with fixed number of terminals
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized Complexity
| Hi-index | 0.00 |
Given an edge-weighted undirected graph and a list of k source-sink pairs of vertices, the well-known minimum multicut problem consists in selecting a minimum-weight set of edges whose removal leaves no path between every source and its corresponding sink. We give the first polynomial-time algorithm to solve this problem in planar graphs, when k is fixed. Previously, this problem was known to remain NP-hard in general graphs with fixed k, and in trees with arbitrary k; the most noticeable tractable case known so far was in planar graphs with fixed k and sources and sinks lying on the outer face.