Kursinformationen
Kursbeschreibung
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.
|
SS20: Visualisierung von Graphen
Ödevler
Konu | Ödevler | Son teslim tarihi | Gönderim | Not |
---|---|---|---|---|
Übungen und Übungsblätter | Exercise sheet #1: Drawing trees | Perşembe, 30 Nisan 2020, 10:15 AM | ||
Exercise sheet #2: Canonical orders | Pazar, 10 Mayıs 2020, 9:00 AM | |||
Exercise sheet #3: Schnyder realiser | Perşembe, 14 Mayıs 2020, 10:15 AM | |||
Exercise sheet #4: Orthogonal drawings | Perşembe, 28 Mayıs 2020, 11:00 AM | |||
Exercise sheet #5: Upward planar drawings | Perşembe, 4 Haziran 2020, 4:00 PM | |||
Exercise sheet #6: Hierarchical layouts | Perşembe, 18 Haziran 2020, 10:15 AM | |||
Exercise sheet #7: Contact representations | Perşembe, 25 Haziran 2020, 4:15 PM | |||
Exercise sheet #8: The Crossing Lemma | Perşembe, 2 Temmuz 2020, 4:15 PM | |||
Exercise sheet #9: Force-Directed Methods | Perşembe, 9 Temmuz 2020, 4:00 PM | |||
Exercise sheet #10: Visibility Representation | Perşembe, 16 Temmuz 2020, 4:00 PM |