title: algorithm to find max independent set in a tree
body: <p>I need an algorithm to find max independent set in a tree. I'm thinking start from all leaf nodes, and then delete the direct parent nodes to these leaf nodes, then choose the parent nodes of the parent nodes we deleted, repeat this procedure recursively until we get to root. and is this done in O(n) time? any reply is appreciated. thanks.</p>
  
  <p>And could anyone please point me an algorithm to find the max dominating set in a tree.</p>