Groups
Category
Level
Tree DP solves matching, vertex cover, and independent set on trees in linear time using small state transitions per node.
Binary lifting precomputes 2^k ancestors for every node so we can jump upward in powers of two.
A bridge tree is built by contracting every 2-edge-connected component of an undirected graph into a single node, leaving only bridges as edges between nodes.