Complexity classes, NP-complete graph problems, Hamiltonian paths and cycles, the traveling salesman problem, graph isomorphism, parameterized complexity, fixed-parameter tractability, and approximation hardness.
| Chapter | Title |
|---|---|
| 111 | Complexity Classes |
| 112 | NP-Complete Graph Problems |
| 113 | Hamiltonian Paths and Cycles |
| 114 | Traveling Salesman Problem |
| 115 | Graph Isomorphism Problem |
| 116 | Parameterized Complexity |
| 117 | Fixed-Parameter Tractability |
| 118 | Approximation Hardness |