A continuation of the algorithms part of CMPT 360. Some of the algorithm techniques include: augmenting algorithms for network flows, matching and graph connectivity, geometric algorithms for nearest neighbour, intersection problems, and convex hull, parallel and distributed algorithms. Weekly hours: 3 Lecture hoursPrerequisite(s): CMPT 360.3. Note: Students with credit for CMPT 416 or CMPT 810 may not take this course for credit. Costs in addition to tuition apply to this course.
A continuation of the algorithms part of CMPT 360. Some of the algorithm techniques include: augmenting algorithms for network flows, matching and graph connectivity, geometric algorithms for nearest neighbour, intersection problems, and convex hull, parallel and distributed algorithms. Weekly hours: 3 Lecture hoursPrerequisite(s): CMPT 360.3. Note: Students with credit for CMPT 416 or CMPT 810 may not take this course for credit. Costs in addition to tuition apply to this course.
