inf405 - Algorithmic Graph Theory

At the end of the lecture period

Written exam

Graphs are the most frequently used abstraction in computer science. Every system which consists of discrete states or objects and relations between these can be modelled as a graph. Most applications require efficient algorithms to process such graphs (Turau, 1996). This module provides typical graph theory problems and algorithmic solutions. They are discussed with regard to their efficiency and applicability and many of the algorithms will be implemented. An important aspect of this module is to consider different approaches to problems and learn different solution strategies.

Professional competence
The students:

• identify basic terms of graph theory and optimization and illustrate them with examples
• name typical graph theory problems and algorithmic solutions
• identify situations where graph algorithms can be applied
• discuss typical graph theory problems and algorithmic solutions with regard to their efficiency and applicability.
• implement graph algorithms
• know proof strategies and are able to apply them

Methodological competence
The students:

• extend their knowledge about algorithms and their complexity
• develop their programming skills
• expand their range of methods of mathematical modelling

Social competence
The students:

• use the language of mathematics to discuss problems in groups with different knowledge levels
• present their ideas in a comprehensible way
• Expand and improve their own ideas through the comments of their fellow students

Self-competence
The students:

• reflect their knowledge about algorithms and their complexity
• develop appropriate solutions for given problems
• challenge methods of resolution