Complexity and Exact Algorithms for Mulitcut

Introduction RVMC in Trees RVMC in Interval Graphs RVMC in General Graphs ConclusionFPT-algorithm — search tree2) While L ≠ ∅, consider the first element u of L (least commonancestor of pair (v, w)):ulca(v, w)uu’lca(v, w)u = vuv’ w’lca(v, w)uv’ w’vwwvwvwCase 1:u /∈ S (nonterminal)→ remove uCase 2a:u ∈ S, u = v or u = w→ remove u ′ ∈ PCase 2b: (branching)u ∈ S, u ≠ v and u ≠ w→ remove u ′ or v ′Termination: If L = ∅ or k nodes have been removed.