Graph Theory with Applications
Lecturer Kim Allan Andersen
Contents This course is an introduction to the theory of finite graphs and will be relevant in particular for students in Operations Research. We will cover the general theory for finite graphs, planarity and duality, connectivity and matching, covering and colouring, flows in networks and graph algorithms. In particular, we will implement some of the graph algorithms using Pascal or C++.
Qualifications Mathematical Programming. Textbooks Swamy, M.N.S. and K. Thulasiraman:
Graphs: Theory and Algorithms, John Wiley & Sons, 1992.
Evaluation Satisfactory answers to a number of assignments (exercises) must be produced.
ECTS-credits 10.
Quarter Autumn 2003.