Workload:
90 h
|
Module Number INF3412 |
Module Title Graphalgorithms and Applications |
Type of Module Elective Compulsory |
|---|---|---|
| ECTS | 3 | |
|
Work load - Contact time - Self study |
Workload:
90 h Class time:
30 h / 2 SWS Self study:
60 h |
|
| Duration | 1 Semester | |
| Frequency | In the winter semester | |
| Language of instruction | German | |
| Type of Exam | Written Test |
|
| Lecture type(s) | Practical Course | |
| Content | This course covers basic graph and network algorithms with emphasis on applications. Important methods are presented for various applications, including network analysis, clustering of data, visualization of graphs, etc., and their implementation to the requirements of the corresponding application is discussed. This will be accompanied by a practical course. Topics include network analysis, pattern search, clustering, and graph drawing. |
|
| Objectives | In this module, students gain advanced knowledge in graph and network algorithms. They can formalize simple and also more difficult problems from different application areas and apply graph and network methods within the formal basics. (Simple) extensions of the basic methods can be designed and realized by the students 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 | Kaufmann | |
| Literature | Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms Mehlhorn, Näher: LEDA - A platform for combinatorial and geometric computation Papadimitriou, Steiglitz: Combinatorial optimization : algorithms and complexity |
|
| Last offered | unknown | |
| Planned for | currently not planned | |
| Assigned Study Areas | BIOINFM2510, INFM2510, INFM3410, MDZINFM2510, MEINFM3210 | |