Lecture29 - CSE 421 Algorithms Richard Anderson Lecture 29 NP-Completeness and course wrap-up Today NP-completeness Reductions Problem Thresholds

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
CSE 421 Algorithms Richard Anderson Lecture 29 NP-Completeness and course wrap-up
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Today NP-completeness Reductions Problem Thresholds Number problems What is NP? What we don’t know about NP-completeness Course summary Evaluations
Background image of page 2
NP-Completeness Reductions If X is NP-Complete, Y is in NP, and X < P Y, then Y is NP-Complete
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Hamiltonian Circuit, Hamiltonian Path How do you show that Hamiltonian Path is NP-Complete?
Background image of page 4
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
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
HamPath < P DirHamPath How do you show that Directed Hamiltonian Path is NP-Complete?
Background image of page 6
Given a graph G, does G have an independent set? Given a graph G, does G have an independent set of size 7?
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
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.

Page1 / 14

Lecture29 - CSE 421 Algorithms Richard Anderson Lecture 29 NP-Completeness and course wrap-up Today NP-completeness Reductions Problem Thresholds

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online