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

More documents

Recommendations

Info

6/52Fast Exponential-Time AlgorithmsIterative CompressionBasic ApproachFor i = 1, 2, . . . , n, compute α(G i ) and a maximum independentset B i of G i . Thus B n is a maximum independent set of G n = G.Compression (Expansion) : Given a maximum independent set B iof G i , compute a maximum independent set of G i+1 = G i + v i+1 .How are we making use of the maximum independent set B i ?
6/52Fast Exponential-Time AlgorithmsIterative CompressionBasic ApproachFor i = 1, 2, . . . , n, compute α(G i ) and a maximum independentset B i of G i . Thus B n is a maximum independent set of G n = G.Compression (Expansion) : Given a maximum independent set B iof G i , compute a maximum independent set of G i+1 = G i + v i+1 .How are we making use of the maximum independent set B i ?
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 17: 5/52Fast Exponential-Time Algorithm
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?