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 ConclusionHardness results <strong>for</strong> general graphsRestricted Vertex Multicut is NP-complete if thereare at least six terminals. [Dahlhaus et al., SIAM Journal onComputing, 1994]There is no FPT-algorithm with respect to the parameter“number of terminals”.RVMC is NP-complete <strong>for</strong> trees with bounded vertex degree<strong>and</strong> bounded pathwidth → no FPT-algorithm with path- ortreewidth as parameter.IdeaA combination of both parameters “number of terminals” <strong>and</strong>treewidth leads to an FPT-algorithm.
Change language