Approximate max-flow min-(multi)cut theorems and their applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Multiway Cuts in Directed and Node Weighted Graphs
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized graph separation problems
Theoretical Computer Science - Parameterized and exact computation
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
Computational Complexity
A logical approach to multicut problems
Information Processing Letters
A fixed-parameter algorithm for the directed feedback vertex set problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algorithmic Aspects of Graph Connectivity
Algorithmic Aspects of Graph Connectivity
FPT algorithms for path-transversals and cycle-transversals problems in graphs
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Complexity and exact algorithms for multicut
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Subset feedback vertex set is fixed-parameter tractable
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Multicut in trees viewed through the eyes of vertex cover
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Important separators and parameterized algorithms
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Restricted vertex multicut on permutation graphs
Discrete Applied Mathematics
On multiway cut parameterized above lower bounds
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
On polynomial kernels for structural parameterizations of odd cycle transversal
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Multicut in trees viewed through the eyes of vertex cover
Journal of Computer and System Sciences
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Clique cover and graph separation: new incompressibility results
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Fixed-parameter tractability of multicut in directed acyclic graphs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized tractability of multiway cut with parity constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Partitioning into colorful components by minimum edge deletions
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Completely inapproximable monotone and antimonotone parameterized problems
Journal of Computer and System Sciences
On the parameterized complexity of finding separators with non-hereditary properties
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On multiway cut parameterized above lower bounds
ACM Transactions on Computation Theory (TOCT)
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
An o *(1.84 k) parameterized algorithm for the multiterminal cut problem
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
An O*(1.84k) parameterized algorithm for the multiterminal cut problem
Information Processing Letters
The complexity of multicut and mixed multicut problems in (di)graphs
Theoretical Computer Science
On the generalized multiway cut in trees problem
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Let G=(V,E) be a graph on n vertices and R be a set of pairs of vertices in V called requests. A multicut is a subset F of E such that every request xy of R is cut by F, i.e. every xy-path of G intersects F. We show that there exists an O(f(k)nc) algorithm which decides if there exists a multicut of size at most k. In other words, the Multicut problem parameterized by the solution size k is Fixed-Parameter Tractable.