Question: Suppose we are given an n-node rooted tree T, such that each node v in T is given a weight w(v). An independent set of
Suppose we are given an n-node rooted tree T, such that each node v in T is given a weight w(v). An independent set of T is a subset S of the nodes of T such that no node in S is a child or parent of any other node in S. Design an efficient dynamic programming algorithm to find the maximum-weight independent set of the nodes in T, where the weight of a set of nodes is simply the sum of the weights of the nodes in that set. What is the running time of your algorithm?
Step by Step Solution
3.40 Rating (150 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
Document Format (2 attachments)
2036_61d6ac34263d3_835417.pdf
180 KBs PDF File
2036_61d6ac34263d3_835417.docx
120 KBs Word File
