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.