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:
Implementation might be coming, might not be coming.