Bölüm anahatları

  • 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 modelling and solving of problems with the help of graphs and graph algorithms.

    We expect at least two foreign students for this course; therefore the lecture and the tutorial will be in English. Of course, questions can always be asked in German, too.

    Lectures: Thursdays, 10:15–11:45 at Seminarraum III (room A005), Building M2 (first lecture: Thu, April 28)
    Tutorials: Mondays, 16:15–17:45 at Seminarraum III (first tutorial: Mon, May 2)
    Lecturers: Alexander Wolff (lectures) and Tim Hegemann, Diana Sieper (tutorials)
    Assessment: Oral examination (one candidate each, approx. 20 minutes) on Fri, August 5.
    If you achieve at least 50% of 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:
    Please check Jonathan Klawitter's lecture videos from last year. They are here.

    Registration
    Please enroll into this WueCampus course room: click on the blue gears symbol at the top left of the screen and then select "enrol me in this course" / "Mich in diesen Kurs einschreiben".
    For the assessment, you need to register at WueStudy; the registration is open from April 16 until July 15.

    Literature