原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
edges that are independent of the clauses and “clause” edges that depend on the clauses.
As Figure 34.20 shows, the literal edges form a triangle on the three special vertices TRUE, FALSE, and RED, and they also form a triangle on xi, ¬xi, and RED for i = 1, 2,
… , n. d. Consider a graph containing the literal edges. Argue that in any 3-coloring c o
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea