Improved algorithms for feedback vertex set problems
Journal of Computer and System Sciences
Randomized disposal of unknowns and implicitly enforced bounds on parameters
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fixed-parameter tractability of multicut parameterized by the size of the cutset
Proceedings of the forty-third annual ACM symposium on Theory of computing
How to cut a graph into many pieces
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Paths, flowers and vertex cover
ESA'11 Proceedings of the 19th European conference on Algorithms
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
On multiway cut parameterized above lower bounds
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
FPT algorithms for path-transversal and cycle-transversal problems
Discrete Optimization
Fixed-Parameter tractability of almost CSP problem with decisive relations
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
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
Clustering with local restrictions
Information and Computation
On multiway cut parameterized above lower bounds
ACM Transactions on Computation Theory (TOCT)
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
A faster FPT algorithm for Bipartite Contraction
Information Processing Letters
An O*(1.84k) parameterized algorithm for the multiterminal cut problem
Information Processing Letters
On the generalized multiway cut in trees problem
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
The parameterized node multiway cut problem is for a given graph to find a separator of size bounded by k whose removal separates a collection of terminal sets in the graph. In this paper, we develop an O(k4k n 3) time algorithm for this problem, significantly improving the previous algorithm of time $O(4^{k^{3}}n^{5})$for the problem. Our result gives the first polynomial time algorithm for the minimum node multiway cut problem when the separator size is bounded by O(log n).