Workload:
180 h
|
Module Number INF3432 |
Module Title Graph Theory |
Type of Module Elective Compulsory |
|---|---|---|
| ECTS | 6 | |
|
Work load - Contact time - Self study |
Workload:
180 h Class time:
60 h / 4 SWS Self study:
120 h |
|
| Duration | 1 Semester | |
| Frequency | Irregular | |
| Language of instruction | German | |
| Type of Exam | Written exam |
|
| Lecture type(s) | Lecture, Tutorial | |
| Content | This module deals with the basics of graph theory. Many problems, especially in algorithmics, can be traced back to graphs, which is why graph theory plays an important role in both mathematics and computer science. Students learn about topics such as planarity, colorability, matchings, factors and Hamilton circles. |
|
| Objectives | The students know the most important foundations in graph theory and how to apply graph theoretical concepts in suitable contexts. They know basic terms such as planarity, subgraphs, factors and graph colorability. They are able to trace simple problems back to graphs and solve them independently. |
|
| Allocation of credits / grading |
Type of Class
Status
SWS
Credits
Type of Exam
Exam duration
Evaluation
Calculation
of Module (%) |
|
| Prerequisite for participation | There are no specific prerequisites. | |
| Lecturer / Other | Schlipf | |
| Literature | Wird in der 1. Sitzung bekannt gegeben. / Will be announced in the first session. |
|
| Last offered | unknown | |
| Planned for | Sommersemester 2024 | |
| Assigned Study Areas | BIOINFM2510, INFM2510, INFM3410, MDZINFM2510, MEINFM3210 | |