Chapter 0 Graph Algorithms¶
Chapter 1 Limits to Computing¶
- 1.1. Limits to Computing
- 1.2. Reductions
- 1.3. NP-Completeness
- 1.4. NP-Completeness Proofs
- 1.5. The Clique Problem
- 1.6. The Independent Set Problem
- 1.7. The Vertex Cover Problem
- 1.8. Reduction of Clique to Independent Set
- 1.9. Reduction of Independent Set to Vertex Cover
- 1.10. Reduction of 3-SAT to Hamiltonian Cycle
- 1.11. Unsolveable Problems
