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 ConclusionMulticutDefinitionInput:Undirected graph G = (V , E)Set of terminals S ⊆ VSet of pairs of terminals H ⊆ S × STask: Find a minimum set of edges or vertices whose removaldisconnects each pair of H.edge deletionMultiterminal Cut (MTC)Edge Multicut (EMC)vertex deletionUnrestricted Vertex Multicut (UVMC)Restricted Vertex Multicut (RVMC)
Change language