This course covers the most important algorithms to draw graphs. Methods from the course Algorithmische Graphentheorie (Algorithmic Graph Theory) such as divide and conquer, flow networks and integer programming will be used. We will become familiar with measures of quality of a graph drawing as well as algorithms that optimize these measures.
Our goal is to get an overview of graph visualization and familiarize with common tools in order to consolidate our knowledge about the modeling and solving of problems with the help of graphs and graph algorithms.
The language of this course will be English.
| Lectures: |
Friday, 10:15–11:45 in Seminarraum II, Computer Science Building (M2), starting on April 25. No lecture on June 27. The last lecture (on July 25) will take place in M4.00.001 due to the EXPO. |
| Tutorials: |
Wednesday, 16:00–17:30 in Seminarraum II, Computer Science Building (M2), starting on April 30. No tutorial on July 2. |
| Lecturers: |
Alexander Wolff (lectures) and Samuel Wolf (tutorials) |
| Assessment: |
Oral examination (one candidate each, approx. 20 minutes) on 05.08.2025.
If you achieve at least 50% of the points on the exercise sheets, you receive a 0.3 grade bonus on the final grade (provided that you pass the oral exam). |
| Extend: |
5 ECTS, 2+2 SWS |
| Prerequisites: |
Highly recommended: Algorithmische Graphentheorie (Algorithmic Graph Theory) |
| Target Audience: |
Master Computer Science, Master Mathematics, Master Computational Mathematics, etc. |
| Videos: |
There will be no new videos. Videos in German from the course in 2021 by Jonathan Klawitter will be made available. |
Registration
Please enroll into this WueCampus course room: use the rightmost item in the bar below the course title: "Mich in diesem Kurs einschreiben".
You also need to register in WueStudy (except if you are an Erasmus student); the registration is open from April 16 until July 15. If you do not register, you cannot take the oral exam.
Literature
