Complexity and Exact Algorithms for Mulitcut
Complexity and Exact Algorithms for Mulitcut
Complexity and Exact Algorithms for Mulitcut
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
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)vwCase 1:u /∈ S (nonterminal)→ remove u