Résumé de section

►Topics and Lectures

  • Graph Drawing: Algorithms for the Visualization of Graphs

    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 or German depending on whether there are non-German speakers participating or not.
     
    Lectures: Friday, 10:15–11:45 in Seminarraum II, Computer Science Building (M2), starting on April 19. No lecture on June 28.
    Tutorials: Wednesday, 16:00–17:30 in Seminarraum II, Computer Science Building (M2), starting on April 24. No exercise session on June 26.
    Lecturers: Johannes Zink (lectures) and Oksana Firman (tutorials)
    Assessment: Oral examination (one candidate each, approx. 20 minutes) on Thursday, August 1 (+ if needed August 2).
    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 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".
    For the assessment, you need to register in WueStudy; the registration is open from April 16 until July 15.

    Literature

►Topics and Lectures