15453 Formal Languages, Automata, and Computation
Lecture 36: The Hamiltonian Path Problem
To illustrate reduction techniques further, we discuss the
NPcompleteness of Hamiltonian Paths, both on directed and
undirected graphs.
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
