November 2010
Intermediate to advanced
332 pages
11h 57m
English
If you're having hull problems, I feel bad for you, son; I've got 99 problems, but a breach ain't one. | ||
| --Anonymous[160] | ||
This appendix does not list every problem and algorithm mentioned in the book, because some algorithms are only discussed to illustrate a principle and some problems serve only as examples for certain algorithms. The most important problems and algorithms, however, are sketched out here, with some references to the main text. If you're unable to find what you're looking for by consulting this appendix, take a look in the index.
In most descriptions in this appendix, n refers to the problem size (such as the number of elements in a sequence). For the special case of graphs, though, ...