CSC 422

Graph Algorithms

Units: 1.5

Hours: 3-0-0

Detailed study, from the algorithmic point of view, of some tractable and intractable graph problems. Some tractable problems are path problems, spanning trees, network flows, matchings, and planarity testing. Some intractable problems are clique, independent set, vertex cover, Hamiltonian cycle, and colouring problems. Various strategies for handling intractable problems are presented including intelligent backtracking, distributed and parallel computing, parameterized complexity, restrictions to graph sub-classes, randomized and approximation algorithms.

Prerequisites:

Undergraduate course in Computer Science offered by the Department of Computer Science in the Faculty of Engineering.

Schedules:
Summer 2018 Fall 2018 Spring 2019

Summer timetable available: February 15. Fall and Spring timetables available: May 15.

Before these dates the class schedule will show "No classes were found that meet your search criteria". If this message is shown after these dates, the course is not scheduled for the selected term.