Fast Exponential-Time Algorithms to solve NP-complete ... - Lita

More documents

Recommendations

Info

4/52ertices of degree at most two are alwFast Exponential-Time AlgorithmsBranchingAlgorithm of Fomin et al.The following simple property holdsAn Exampleolding of a vertex v.v1 23 4 5⇒ 123 4 5
5/52Fast Exponential-Time AlgorithmsBranchingThe Algorithm of Fomin et al.Advantages and Disadvantages of FoldingWhy using folding ?The domination rule (2) and Folding (3) guarantee that thecurrent graph has minimum degree 3 whenever the only branchingrule (4) is applied.Disadvantages of foldingFolding may increase the degree of the graph, and thus cannot beused for algorithms on graphs of bounded degree.Folding makes it impossible to use Memorization.
Page 1 and 2: Fast Exponential-Time Algorithms/52
Page 3 and 4: 3/52Fast Exponential-Time Algorithm
Page 5 and 6: 52Fast Exponential-Time AlgorithmsI
Page 11 and 12: 10/52Fast Exponential-Time Algorith
Page 43: 33/52Fast Exponential-Time Algorith
Page 49 and 50: x v, we can discard its mirrors as
Page 51 and 52: well without modifying the maximum7
Page 65 and 66: Fast Exponential-Time AlgorithmsCon
Page 67: Fast Exponential-Time AlgorithmsCon

Fast Exponential-Time Algorithms to solve NP-complete ... - Lita

Create successful ePaper yourself

Delete template?

Save as template?