CS 658 - Algorithms II3 credits
Recurrences, probabilistic analysis, randomized algorithms, red-black trees, amortized analysis, Fibonacci heap, disjoint set union, the all pairs shortest path problem, and maximum flow.
Prerequisites
CS 458 with a C or better or CS 558 with a C or better
Click here for the Fall 2025 Class Schedule
Click here for the Spring 2026 Class Schedule
Click here for the Summer 2026 Class Schedule
Add to Portfolio (opens a new window)
|