instructor view | Information Center | Home
Information Center
Sample Chapter
Table of Contents
Book Preface
Feature Summary
Computer Science C...

Help Center

Table of Contents

Chapter 0: Prologue

Chapter 1: Algorithms with numbers

Chapter 2: Divide-and-conquer algorithms

Chapter 3: Decompositions of graphs

Chapter 4: Paths in graphs

Chapter 5: Greedy algorithms

Chapter 6: Dynamic programming

Chapter 7: Linear programming

Chapter 8: NP-complete problems

Chapter 9: Coping with NP-completeness

Chapter 10: Quantum algorithms

Click on the link below to view the full Table of Contents.

TOC (39.0K)