MATH 3600
Combinatorics

Course Description

Advanced counting methods: permutations and combinations, generalized permutations and combinations, recurrence relations, generating functions; algorithms: graphs and digraphs, graph algorithms: minimum-cost spanning trees, shortest path, network flows; depth first and breadth-first searches; combinational algorithms: resource scheduling, bin-packing: algorithmic analysis and NP completeness.

Offerings