Independent set
Kent Quanrud · 74:44 · Watch on YouTube
Maximum independent set is NP-hard on general undirected graphs because 3-SAT reduces to it in polynomial time, but the same problem is polynomial on interval graphs and on trees once you expose a DAG of subproblems a...