Graph minors. VI. Disjoint paths across a disc
Journal of Combinatorial Theory Series B
Improved bounds for the max-flow min-multicut ratio for planar and Kr,r-free graphs
Information Processing Letters
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
The planar multiterminal cut problem
Discrete Applied Mathematics
Two-connected augmentation problems in planar graphs
Journal of Algorithms
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract)
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Multiway cuts in node weighted graphs
Journal of Algorithms
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Discrete Applied Mathematics
A polynomial-time approximation scheme for planar multiway cut
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Multicut algorithms via tree decompositions
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
A polynomial-time algorithm for planar multicuts with few source-sink pairs
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
| Hi-index | 0.04 |
Given an edge-weighted graph G and a list of source-sink pairs of terminal vertices of G, the minimum multicut problem consists in selecting a minimum weight set of edges of G whose removal leaves no path from the ith source to the ith sink, for each i. Few tractable special cases are known for this problem. In this paper, we give a simple polynomial-time algorithm solving it in undirected planar graphs where (I) all the terminals lie on the outer face and (II) there is a bounded number of terminals.