This course covers the most important algorithms for drawing graphs. We will use methods from algorithmic graph theory and algorithmics such as divide and conquer, flow networks and integer programming. We will get to know measures for the quality of a graph drawing and algorithms that optimize these measures. Methods for drawing trees, planar graphs on grids, orthogonal visualizations and directed graphs will be presented and analyzed.
- Dozent: Stephen Kobourov
- Dozent: Johannes Zink