Dynamic Programming

  1. Tree Dynamic Programming
    1. Tree Structure Exploitation
      1. Subtree Independence
        1. Root-Based Decomposition
        2. Tree DP Implementation Patterns
          1. DFS-Based Traversal
            1. State Propagation Methods
              1. Parent-Child Relationships
              2. Classic Tree DP Problems
                1. Tree Diameter
                  1. Path Through Root
                    1. Path Not Through Root
                    2. Maximum Path Sum
                      1. Node Value Considerations
                        1. Path Definition Variations
                        2. Tree Coloring Problems
                          1. Independent Set on Trees
                            1. Vertex Cover on Trees
                            2. Subtree Size Problems
                              1. Counting Nodes
                                1. Weighted Subtree Sums

                            Previous

                            8. Knapsack Problem Variants

                            Go to top

                            Next

                            10. Counting Dynamic Programming