Complexity and Exact Algorithms for Mulitcut

More documents

Recommendations

Info

Introduction RVMC in Trees RVMC in Interval Graphs RVMC in General Graphs ConclusionFPT-algorithmTheoremRVMC in trees can be solved in O(2 k · |V | · |H|) time, where k isthe number of allowed vertex removals.FPT-algorithm is based on a depth-bounded search treePreprocessing of the instance T = (V , E) with S and H:112 6 72, 3,46 7, 93 4 5 8 958Figure: H = {(2, 9), (3, 6), (4, 7)}. Edges with both endpoints beingterminals are contracted.
Introduction RVMC in Trees RVMC in Interval Graphs RVMC in General Graphs ConclusionFPT-algorithm — search tree1) Compute the least common ancestor (lca) for each terminal pairand sort them by decreasing depth in a list L.2ndlca( )lca( )3rdlca( )5thlca( )4thlca( )1st
Page 1 and 2: Introduction RVMC in Trees RVMC in
Page 9: Introduction RVMC in Trees RVMC in
Page 40: Introduction RVMC in Trees RVMC in

Complexity and Exact Algorithms for Mulitcut

Create successful ePaper yourself

Delete template?

Save as template?