VIII · Classics & longform
Algorithm Design
What it does
Cleaner pedagogy than CLRS for graph algorithms, network flows, and randomised algorithms. Each chapter ends with hard, well-curated problems.
Who should read it
Read after CLRS once you want depth in graph and approximation algorithms specifically.