3-SAT ≤p Hamiltonian Cycle 详解.pptVIP

MCS 312: NP Completeness and Approximation algorithms Instructor Neelima Gupta ngupta@cs.du.ac.in Table of Contents Hamiltonian Cycle Hamiltonian Cycle Problem A Hamiltonian cycle in a graph is a cycle that visits each vertex exactly once Problem Statement Given A directed graph G = (V,E) To Find If the graph contains a Hamiltonian cycle Hamiltonian Cycle Problem Hamiltonian Cycle Problem is NP-Complete Hamiltonian Cycle Problem is in NP. Given a directed graph G=(V,E), and a certificate containing an ordered list of vertices on a Hamiltonian Cycle. It can be verified in