Dynamic programming on trees
3 methods in the atlas attack this one problem. They are rivals: each wins something the others do not.
Phrasings that mean this problem
Rooted subtree optimizationAll-root answersSubtree aggregation
dynamic-programming
- Tree DPstandalonecanondynamic-programming
- DP on treesIn-out rerootingstandarddynamic-programming
graphs-structure
- Small-to-large mergingstandalonestandardgraphs-structure