Explore
This textbook grew out of a collection of lecture notes written for various algorithms classes at the University of Illinois at Urbana-Champaign.
- Introduction
- Recursion
- Backtracking
- Dynamic Programming
- Greedy Algorithms
- Basic Graph Algorithms
- Depth-First Search
- Minimum Spanning Trees
- Shortest Paths
- All-Pairs Shortest Paths
- Maximum Flows & Minimum Cuts
- Applications of Flows and Cuts
- NP-Hardness
A paperback editions and more lecture notes are available on the Author's website.
Why read this book? Have your say.
You must be logged in to comment.
rezaprimardiansyah
