顶点覆盖问题的NP完全证明（Proving NP-completeness of Vertex Cover）

Definition of Vertex Cover Problem: •A vertex cover of a graph is a set of vertices such that each edge of the graph connects at least one of the vertexes in this set. e.g. (z, w) is the set of vertex

>>阅读原文<<