[Algorithms] Ex.8.10

EX.8.10

• NP完全问题

---

题目

Proving NP-completeness by generalization. For each of the problems below, prove that it is NP-complete by showing that it is a generalization of some NP-complete problem we have seen in this chapter.

(a) SUBGRAPH ISOMORPHISM: Given as input two undirected graphs G and H, determine whether G is a subgraph of H (that is, whether by deleting certain vertices and edges of H we obtain a graph that is, up to renaming of vertices, identical to G), and if so, return the corresponding mapping of V (G) into V (H).

(b) LONGEST PATH: Given a graph G and an integer g, find in G a simple path of length g.

(c) MAX SAT: Given a CNF formula and an integer g, find a truth assignment that satisfies at least g clauses.

(d) DENSE SUBGRAPH: Given a graph and two integers a and b, find a set of a vertices of G such that there are at least b edges between them.

(e) SPARSE SUBGRAPH: Given a graph and two integers a and b, find a set of a vertices of G such that there are at most b edges between them.

(f) SET COVER. (This problem generalizes two known NP-complete problems.)

(g) RELIABLE NETWORK: We are given two n*n matrices, a distance matrix dij and a connectivity requirement matrix rij , as well as a budget b; we must find a graph G = ({1, 2, … , n}, E) such that (1) the total cost of all edges is b or less and (2) between any two distinct vertices i and j there are rij vertex-disjoint paths. (Hint: Suppose that all dij ‘s are 1 or 2, b = n, and all rij ‘s are 2. Which well known NP-complete problem is this?)

答案

(a) 子图同构： 令图 G 为一个环，环上的顶点数等于图 H 的顶点数。若 G 是 H 的同构子图，则说明 H 存在 Rudrata 回路，由此可知 Rudrata 回路实际上是子图同构的一个特例。

(b) 最长路径： 令 g = |V| - 1，即可得到一条 Rudrata 路径。
(c) 最大 SAT： 令 g 为子句的总数，即成 SAT。
(d) 稠密子图： 令 b = a*(a-1) / 2，此时这 a 个顶点两两相连，即成最大团问题。
(e) 稀疏子图： 令 b = 0，即成最大独立集问题。
(f)集合覆盖： 显然是最小定点覆盖的一个推广。
(g)可靠网络： Hint中所描述的特例即是一个 TSP。