
520 Design and Analysis of Algorithms
A problem is in class NP iff a P-time A (x, y) exists.
The following problems are in NP.
Satisfi ability Is a Boolean expression satisfi able?
Clique Does an undirected graph have a clique of size k?
Vertex Cover (VC) Does an undirected graph have a VC of size k?
Hamilton Circuit (HC) Does an undirected graph have a HC?
Colourability Is an undirected graph k-colourable?
Directed Hamilton Circuit Does a directed graph have a directed HC?
Set Cover Given a family of sets S
1
, S
2
, . . . , S
n
, does there exist a sub-family of k sets S
i1
, S
i2
, . . . , S
ik
,
such that
1
k
=
∪
S
ij
=
1
n
j=
∪
S
j
?
Exact Cover Given a family ...