原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
, k} such that c(u) ≠ c(v) for every edge (u, v) ∈ E. In other words, the numbers 1, 2, …
, k represent the k colors, and adjacent vertices must have different colors. The graph-coloring problem is to determine the minimum number of colors needed to color a given graph. a. Give an efficient algorithm to
determine a 2-coloring of a graph, if one exists. b. Cast the graph-coloring problem as a
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea