原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
responds to edges (s1, [w, x, 1]) and (s2, [y, x, 1]) appearing in the hamiltonian cycle.
Next we show that the size of G′ is polynomial in the size of G, and hence it takes time polynomial in the size of G to construct G′. The vertices of G′ are those in the gadgets, plus the selector vertices. With 12 vertices per gadget, plus k ≤ |V | selector vertices, G′ contains a total of |V′| = 12 |E| + k ≤ 12 |E| + |V| vertices.
The edges of G′ are those in the gadgets, those that go between gadgets, and those connec
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea