3.00 Credits
Study of selected topics in advanced algorithms drawn from graph algorithms (network flows, matchings, cuts, planarity testing), approximation algorithms (traveling salesman, linear relaxation techniques), distributed algorithms (mutual exclusion, synchronization, self-stabilization), parallel algorithms (parallel prefix, models, sorting), or randomized algorithms (sampling, probabilistic methods, random walks). May be repeated for a maximum of nine credits, but only if different topics are covered. Preq: CPSC 8400.