Stud.IP Uni Oldenburg
University of Oldenburg
07.02.2023 08:30:49
inf405 - Algorithmic Graph Theory (Complete module description)
Original version English PDF Download
Module label Algorithmic Graph Theory
Modulkürzel inf405
Credit points 6.0 KP
Workload 180 h
Institute directory Department of Computing Science
Verwendbarkeit des Moduls
  • Dual-Subject Bachelor's Programme Computing Science (Bachelor) > Wahlpflicht Theoretische Informatik (30 KP)
  • Master of Education Programme (Gymnasium) Computing Science (Master of Education) > Wahlpflichtmodule (Theoretische Informatik)
Zuständige Personen
Lehrenden, Die im Modul (Prüfungsberechtigt)
Lehrenden, Die im Modul (Module responsibility)
Prerequisites
Skills to be acquired in this module
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
Module contents
A) Trees
B) Search Algorithms
C) Graph Coloring
D) Flows in Networks
E) Applications of Network Algorithms
F) Shortest Paths
G) Approximation Algorithms
G) Approximation Algorithms
Literaturempfehlungen
Jungnickel, Dieter: Graphs, Networks and Algorithms. Springer, Berlin,
Heidelberg, 4th edition, 2013. Available as an E-Book in BIS.
A detailed bibliography is contained in the lecture notes of this module.
Links
Language of instruction German
Duration (semesters) 1 Semester
Module frequency jährlich
Module capacity unlimited
Modullevel / module level AS (Akzentsetzung / Accentuation)
Modulart / typ of module je nach Studiengang Pflicht oder Wahlpflicht
Lehr-/Lernform / Teaching/Learning method V+Ü
Vorkenntnisse / Previous knowledge Grundveranstaltungen Mathematik und Informatik
Form of instruction Comment SWS Frequency Workload of compulsory attendance
Lecture 3 SoSe 42
Exercises 1 SoSe 14
Präsenzzeit Modul insgesamt 56 h
Examination Prüfungszeiten Type of examination
Final exam of module
At the end of the lecture period
Written exam