Graph Theory (GRA)
6/7. Semester
5 ECTS | 4 SWS
Continuous Assessment (CA)
Understand and Use Networks: Work with connections and structures, develop algorithms, and apply them to solve practical problems.
Contents
- Fundamentals of Graph Theory
- Eulerian Graphs
- Graph Coloring
- Matchings
- Basic Digraph Models and Properties
- Directed Acyclic Graphs
- Tournaments
- Maximum Flows
Competencies
Students are able to
- The students are able to
- recognise and explain usage scenarios and limts of learnt algorithms
- understand and implement seleced graph algroithmus
- explain and present the results to colleques not being famuiliar with it
Literature
- A. Steger: Diskrete Strukturen, Band 1, Springer
- Peter Hartmann: Mathematik für Informatiker, Vieweg
- J.Clark, D.A. Holton: Graphentheorie, Spektrum Verlag
Lecturer
Recommended Previous Knowledge
Module Details
| Semester |
6/7 |
| Lecture Language |
German |
|
Frequency
|
Not regularly
|
| Credit Points (ECTS)
|
5 |
| Course Coordinator |
Prof. Dr. Elena Fimmel |
| Duration |
1 Semester |
|
Course Achievement
|
None |
|
Prerequisite for exam
|
None |
|
Exam
|
Continuous Assessment (CA) |
Weekly Hours (SWS)
| Lecture |
2 SWS |
| Exercises |
2 SWS |
| Sum |
4 SWS |
Work Load
| Lecture |
30 h |
| Self Study |
90 h |
| Assignments |
30 h |
| Sum |
150 h |
