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-algorithmTheoremRVMC in trees can be solved in O(2 k · |V | · |H|) time, where k isthe number of allowed vertex removals.FPT-algorithm is based on a depth-bounded search treePreprocessing of the instance T = (V , E) with S <strong>and</strong> H:112 6 72, 3,46 7, 93 4 5 8 958Figure: H = {(2, 9), (3, 6), (4, 7)}. Edges with both endpoints beingterminals are contracted.
Change language