Lecture29 - Today NP-completeness CSE 421 Algorithms...

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

View Full Document Right Arrow Icon
1 CSE 421 Algorithms Richard Anderson Lecture 29 NP-Completeness and course wrap-up Today • NP-completeness – Reductions – Problem Thresholds – Number problems – What is NP? – What we don’t know about NP-completeness • Course summary • Evaluations NP-Completeness Reductions • If X is NP-Complete, Y is in NP, and X < P Y, then Y is NP-Complete Hamiltonian Circuit, Hamiltonian Path How do you show that Hamiltonian Path is NP-Complete? 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 HamPath < P DirHamPath How do you show that Directed Hamiltonian Path is NP-Complete?
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Problem definition • Given a graph G, does G have an independent set? • Given a graph G, does G have an independent set of size 7? • Given a graph G, and an integer K, does
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

Lecture29 - Today NP-completeness CSE 421 Algorithms...

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

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