Networks, Graph Theory and Combinatorial Optimization

3 credits · Undergraduate

(3 hrs Lecture) Topics in this course are chosen from algorithmic complexity and problem classification, trees, distance invariants, Steiner trees, network flows and their applications, PERT networks, connectivity, optimal matchings, packings and coverings, colourings, perfect graphs and graph classes, planar graphs, extremal graph theory, and Ramsey theory. Restrictions: Students may not hold credit for this course and MATH-3013. Requisite Courses: MATH-3401(3) [prerequisite(s)].