原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
= (14 |E|) + (2 |E| − |V|) + (2k |V|) = 16 |E| + (2k − 1) |V| ≤ 16 |E| + (2 |V| − 1) |V|.
Now we show that the transformation from graph G to G′ is a reduction. That is, we must show that G has a vertex cover of size k if and only if G′ has a hamiltonian cycle. Suppose that G = (V, E) has a vertex cover V* ⊆ V, where |V*| = k. Let V* = {u1, u2,
… , uk}. As Figure 34.17 shows, we can construct a hamiltonian cycle in G′ by including t
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea