Dynamic Programming
Subtree Independence
Root-Based Decomposition
DFS-Based Traversal
State Propagation Methods
Parent-Child Relationships
Path Through Root
Path Not Through Root
Node Value Considerations
Path Definition Variations
Independent Set on Trees
Vertex Cover on Trees
Counting Nodes
Weighted Subtree Sums
Previous
8. Knapsack Problem Variants
Go to top
Next
10. Counting Dynamic Programming