Hamiltonian Paths

A path visiting every vertex exactly once — NP-complete.

Expert

Solved by bitmask DP in $O(2^n n^2)$ for small $n$ ; related to the travelling salesman problem.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)