The longest path
Kent Quanrud · 75:44
Longest path (and Hamiltonian path) is polynomial—even linear—on DAGs via topological DP, but NP-hard on general directed and undirected graphs because a SAT formula can be encoded as a polynomial-size graph whose Ham...