Wilfrid Laurier University Undergraduate Academic Calendar - 2011/2012
Canadian Excellence

Discrete Algorithms
0.5 Credit

Polynomial-time algorithms for shortest paths, optimum matchings, optimum network flows and other combinatorial optimization problems. Matroid greedy algorithm. Introduction to approximation algorithms for NP-hard problems. Introduction to polynomial-time recognition algorithms and optimization algorithms for specially structured graph classes.

Additional Course Information
MA122, MA238.