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 ConclusionRVMC hardness results <strong>for</strong> treesPaths: RVMC in trees with maximum vertex degree two issolvable in polynomial time: O(|V | · |H|).TheoremRestricted Vertex Multicut in trees with maximum vertexdegree three is NP-complete.Trees: NP-completeness has been shown <strong>for</strong> RVMC in treeswith maximum vertex degree four. [Călinescu et al., Journalof <strong>Algorithms</strong>, 2003]In comparison: Unrestricted Vertex Multicut in treescan easily be solved in O(|V | · |H|) time (least commonancestor).
Change language