Complexity and Exact Algorithms for Mulitcut
Complexity and Exact Algorithms for Mulitcut
Complexity and Exact Algorithms for Mulitcut
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 ConclusionSummaryGraph class Parameter EMC UVMC RVMCInterval graphs NP-c NP-c PTrees NP-c P NP-ck FPT P FPTGeneral graphs NP-c NP-c NP-ck open open open|S| NP-c FPT NP-cω NP-c NP-c NP-c|S| <strong>and</strong> ω FPT FPT FPTTable: <strong>Complexity</strong> of Multicut problems <strong>for</strong> several graph classes.|S|: number of terminals, k: number of deletions, ω: treewidth of theinput graph
Change language