Skip to content

Hamiltonian Path is NP-Complete (Directed, Reduction from 3SAT)

Easy Theory40.8K subscribers

53,440 views

About this video

Hand-picked by a BrighterTube curator · found via Reddit r/compsci thread: What are your favorite Comp Sci YouTube channels?

Proves directed Hamiltonian Path is NP-complete with the textbook 3SAT reduction, drawing the variable 'diamond' gadgets and clause nodes on screen.

Proof that directed Hamiltonian Path is NP-complete by reduction from 3SAT.

Video by Easy Theory, played through YouTube's embedded player.

Part of Graphs - Easy Theory, Complexity Theory I - Easy Theory