CSI 5163 Algorithm Analysis and Design
3 units
Computer Science
Faculty of Engineering
Topics of current interest in the design and analysis of computer algorithms for graph-theoretical applications; e.g. shortest paths, chromatic number, etc. Lower bounds, upper bounds, and average performance of algorithms. Complexity theory. This course is equivalent to COMP 5703 at Carleton University.
Components:
Lecture
Previously Offered Terms:
Fall
Winter
French Equivalent: