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 Conclusion¤¥¤¥¦§¦§¨©¨©FPT-algorithm — run timesearch tree¢£¢£Depth: parameter kSize: O(2 k )Update step: O(|V | · |H|) time→ Run time: O(2 k · |V | · |H|)¡¡depth kpossible solutions