Complexity and Exact Algorithms for Mulitcut
Complexity and Exact Algorithms for Mulitcut
Complexity and Exact Algorithms for Mulitcut
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Introduction RVMC in Trees RVMC in Interval Graphs RVMC in General Graphs ConclusionRestricted Vertex Multicut (RVMC)Figure: RVMC instance G = (V , E)with H = {(1, 3), (3, 4)}, k = 2DefinitionInput:Undirected graph G = (V , E)Set of terminals S ⊆ VSet of pairs of terminals H ⊆ S × SInteger k ≥ 0Task: Find a subset V ′ of V with |V ′ | ≤ kthat contains no terminal <strong>and</strong> whoseremoval disconnects each pair of H.1 2 34 5 6
Change language