在第八版书中以及作者提供的网站里并没有找到勘误列表,只好先在此记录。
Chapter 3: Algorithms
P237, paragraph 3, last sentence.
Consult books on algorithm design such as [$\color{red}{KlTa06}$] to learn more about them.
should be
Consult books on algorithm design such as [$\color{green}{KlTa05}$] to learn more about them.
Chapter 6: Counting
P410, last line.
This error also occurs in the 7th edition, page 390.
$|A_1 \cup A_2 \cup … \cup A_m| = |A_1| + |A_2| + … + |A_m|\ when\ A_i \cap A_j = \color{red}{for\ all\ i, j.}$
should be
$|A_1 \cup A_2 \cup … \cup A_m| = |A_1| + |A_2| + … + |A_m|\ when\ A_i \cap A_j = \color{green}{\emptyset\ for\ all\ i \neq j.}$
Chapter 9: Relations
P655, line 2.
such that $\space x \preceq z \space$and $\space z \preceq \color{red}{x} \space$
should be
such that $\space x \preceq z \space$and $\space z \preceq \color{green}{y} \space$
Chapter 10: Graphs
P698, line 1.
and $\space \color{red}{w} \space$ into a new single vertex $\space w$.
should be
and $\space \color{green}{v} \space$ into a new single vertex $\space w$.
P698, line 7.
$\space e \space$ and $\space c \space$ in the graph $\space G_1 \space$ in $\space Figure \space \color{red}{16} \space$ …
should be
$\space e \space$ and $\space c \space$ in the graph $\space G_1 \space$ in $\space Figure \space \color{green}{17} \space$ …
Chapter 10: Graphs
P745, line 7.
There are two such paths to consider, $\space a, d, e \space$ of length $\space \color{red}{7} \space$ and $\space a, b \space$ of length $\space 4 \space$.
should be
There are two such paths to consider, $\space a, d, e \space$ of length $\space \color{green}{5} \space$ and $\space a, b \space$ of length $\space 4 \space$.