Minimum Weight Vertex Cover on Tree Graph
Created at 2016-04-30T22:03:35.000Z

As I've mentioned in some of posts, I'm reading Algorithm Design Manual by Steven S Skiena.

There's one problem attracts my attention. This is about Independent Set problem for tree graph.

Here is a problem statement (from page 187):


I solved this problem as dual, which is Vertex Cover problem.

Here is my solution on paper:

2016-05-01 16.01.08

2016-05-01 16.01.20

2016-05-01 16.01.40

Implementation might be coming, might not be coming.