This preview shows pages 1–8. Sign up to view the full content.
CSE 421
Algorithms
Richard Anderson
Lecture 29
NPCompleteness and course wrapup
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document Today
•
NPcompleteness
–
Reductions
–
Problem Thresholds
–
Number problems
–
What is NP?
–
What we don’t know about NPcompleteness
•
Course summary
•
Evaluations
NPCompleteness Reductions
•
If X is NPComplete, Y is in NP, and
X <
P
Y, then Y is NPComplete
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document Hamiltonian Circuit,
Hamiltonian Path
How do you show that Hamiltonian Path is NPComplete?
Local Modification
•
Convert G to G’
•
Pick a vertex v
–
Replace v by v’ and v’’
–
If (u,v) is an edge, include edges (u, v’), (u, v’’)
•
G’ has a Hamiltonian Path from v’ to v’’ iff G has
a Hamiltonian Circuit
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document HamPath <
P
DirHamPath
How do you show that Directed Hamiltonian Path is NPComplete?
•
Given a graph G, does G have an
independent set?
•
Given a graph G, does G have an
independent set of size 7?
•
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 02/25/2012 for the course CSE 421 taught by Professor Richardanderson during the Fall '06 term at University of Washington.
 Fall '06
 RichardAnderson
 Algorithms

Click to edit the document details