Algorithmic Graph Theory

Module code: MTH6105

Credits: 15.0
Semester: SEM2

Contact: Dr Felix Fischer
Prerequisite: Before taking this module you must take MTH4113 or take MTH4213

The module will give an introduction to graph theory from an algorithmic perspective. It will develop the theory behind some of the most commonly used network algorithms from operational research, describe these algorithms and derive upper bounds on their running time.

Connected course(s): UDF DATA
Assessment: 80.0% Examination, 20.0% Coursework
Level: 6