algorithm Fichas sobre Weighted Independent set for a path or a tree, creado por Amran el 23/07/2014.
|
Creado por Amran
hace casi 10 años
|
|
Cerrar
|
|
Creado por Amran
hace casi 10 años
|
|
Give a dynamic programming algorithm that takes an n-node path G with weights and returns the total weight of the independent set of maximum total weight. The running time should be polynomial in n, independent of the values of the weights.
