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.
Verberge bekannte Karten
1090181
flash_card_deck
2016-12-14T00:31:33Z
Sie müssen sich anmelden, um diese Aktion abzuschließen!