Category
Level
Tree DP solves matching, vertex cover, and independent set on trees in linear time using small state transitions per node.