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 ConclusionFPT-algorithm — the two stagesStage one: Enumerate all possible colorings of the terminal set Swith colors C such that <strong>for</strong> each terminal pair the two terminalsare differently colored (pre-coloring of S).
Change language