Topic outline
-
Description:
This course discusses the most important algorithms for graph drawing. Many methods are imported from the Algorithmic Graph Theory lecture; such as: divide and conquer, network flows, integer programming and the planar separator theorem. We will discuss measures of the quality of graph drawings and algorithms to optimize them.
Learning Objectives:
The participants will receive an overview of the subject graph visualization (a nice topic for a thesis ;) ) and the usual tools therein. They will expand their knowledge of modelling and solving problems using graphs and graph algorithms.
Evaluation:
Grades will be determined by an oral exam at the end of the semester. A bonus of 0,3 points will be awarded to the students who obtain at least 50% of the points on the exercises.
Literature:
- Graph Drawing: Algorithms for the Visualization of Graphs.
Giuseppe Di Battista, Peter Eades, Roberto Tamassia and Ioannis G. Tollis. Prentice Hall, 1999. - Drawing Graphs: Methods and Models.
Michael Kaufmann and Dorothea Wagner (Hrsg.), Lecture Notes in Computer Science, Volume 2025. Springer-Verlag 2001. - Planar Graph Drawing.
Takao Nishizeki and Md Saidur Rahman, Lecture Notes Series on Computing, Volume 12. World Scientific Publishing, 2004
- Graph Drawing: Algorithms for the Visualization of Graphs.
-
Course size:
5 ECTS (2 SWS)
Time & place:
– (most) Lectures on Thursdays, 10:15–11:45, room SE III
– (most) Tutorials on Mondays, 16:00–17:30, room SE III
NOTE: due to holidays some lectures will occur during the tutorial time slot, and vice versa!!!Target group:
Master Computer Science, Master Mathematics, Master Computational Mathematics
Lecturers:
Steven Chaplick (lectures), office E12
Oksana Firman (tutorials)
Alexander Wolff (course coordinator)Exam:
Oral exam: 25.07.2019
Registration required!Pre-requisite
Algorithmic Graph Theory (recommended)
IMPORTANT NOTES:
1) Lectures will be given in English.
2) Cancellations due to holidays: 13.05 (Stuftungsfest), 30.05 (Christi Himmelfahrt), 10.06 (Pfingsten), 20.06 (Fronleichnam)
3) On 08.07 the exercises will be held in ÜR II. -
-