Concepts4
⚙️AlgorithmIntermediate
Tree DP - Matching and Covering
Tree DP solves matching, vertex cover, and independent set on trees in linear time using small state transitions per node.
#tree dp#maximum matching#vertex cover+12
⚙️AlgorithmAdvanced
General Matching - Blossom Algorithm
Edmonds' Blossom Algorithm finds a maximum matching in any undirected graph, not just bipartite ones.
#blossom algorithm#edmonds matching#general graph matching+12
⚙️AlgorithmIntermediate
König's Theorem
König's Theorem states that in any bipartite graph, the size of a maximum matching equals the size of a minimum vertex cover.
#konig's theorem#bipartite matching#minimum vertex cover+12
⚙️AlgorithmIntermediate
Tree Distances and Diameter
Tree diameter is the longest simple path in a tree and can be found with two BFS/DFS runs.
#tree diameter#tree center#eccentricity+12