Fixed-parameter tractability of multicut parameterized by the size of the cutset

Details Fixed-parameter tractability of multicut parameterized by the size of the cutset Fixed-parameter tractability of multicut parameterized by the size of the cutset

2010-10-18

arxiv.org/abs/1010.3633v2

Computer Science

Data Structures and Algorithms

Scientific paper

Given an undirected graph $G$, a collection $\{(s_1,t_1),..., (s_k,t_k)\}$ of pairs of vertices, and an integer $p$, the Edge Multicut problem ask if there is a set $S$ of at most $p$ edges such that the removal of $S$ disconnects every $s_i$ from the corresponding $t_i$. Vertex Multicut is the analogous problem where $S$ is a set of at most $p$ vertices. Our main result is that both problems can be solved in time $2^{O(p^3)}... n^{O(1)}$, i.e., fixed-parameter tractable parameterized by the size $p$ of the cutset in the solution. By contrast, it is unlikely that an algorithm with running time of the form $f(p)... n^{O(1)}$ exists for the directed version of the problem, as we show it to be W[1]-hard parameterized by the size of the cutset.

Affiliated with

Also associated with

No associations

Rating

Fixed-parameter tractability of multicut parameterized by the size of the cutset does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fixed-parameter tractability of multicut parameterized by the size of the cutset, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixed-parameter tractability of multicut parameterized by the size of the cutset will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-306304