Networks, Graph Theory and Combinatorial Optimization
Mathematics · 3 hrs Lecture
Offering schedule: contact department
The calendar doesn't say which term this runs in. The sections below show the terms it actually runs in this year.
MATH-4401 prerequisites
3 courses appear in this chain, up to 3 levels deep. 1 is needed whichever route you take: MATH-3401
Show the chainHide the chain
any one of
Add your completed courses to see which of these you've already done and what you could take next. They stay on this device.
Where MATH-4401 counts
Counts toward 2 more as one option among several, not as a course you must take:
Read from the departments' own calendar pages, where 71 of 141 programs are only partly machine-readable, so treat these as a minimum rather than the full list. Confirm with an academic advisor.
Description
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.
Requisite courses
MATH-3401(3) [prerequisite(s)].
Restrictions
Students may not hold credit for this course and MATH-3013.
From the 2026-27 undergraduate calendar. Always verify details on WebAdvisor or with an academic advisor before registering.