15-453 Formal Languages, Automata, and Computation
Lecture 36: The Hamiltonian Path Problem

To illustrate reduction techniques further, we discuss the NP-completeness of Hamiltonian Paths, both on directed and undirected graphs.

• Reading: Ch. 7.5, pp. 262-268
• Previous lecture: The Vertex-Cover Problem
• Next lecture: Space Complexity

[ Home | Schedule | Assignments | Handouts | Overview ]

fp@cs
Frank Pfenning