I've got one very hard problem.
Given a tree with nodes with integers. We need to find the largest sum of label values for a set of nodes which does not include any adjacent pair of nodes. Algorithm should run in poly time.
Can you help me to solve it ?