inf405 - Algorithmic Graph Theory (Complete module description)
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 |
|
Zuständige Personen |
|
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:
Methodological competence The students:
Social competence The students:
Self-competence The students:
|
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 |
Lehrveranstaltungsform | 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 |