CS 658 - Algorithms II

3 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