University of Konstanz
Algorithmik
Prof. Dr. Ulrik Brandes

Algorithms for Planar Graphs (SS 2013)

+++ News +++

2nd examination date

Wednesday, 2nd October

register in E214

A planar graph is a graph that can be drawn in the plane such that two edges only cross in a common end vertex. In this lecture we will discuss how to exploit properties of planar graphs in order to solve problems more efficiently than on general graphs.

General Information

Lecture (S. Cornelsen) Wed 13:30-15:00 (M628)
Tutorial (S. Cornelsen) Fri 11:45-13:15 - fortnightly (M631)
Exams 1st date: 19 July 2013 (E216)
2nd date: 2 October 2013 (E216): Please sign into a list available at E 214

Assignments

The assignments are made available on this webpage as a PDF-file on Wednesdays at 16:00. To be admitted to the final exam, you are supposed to solve at least 50 percent of the problems in such a way that you could present them during the tutorial. Regular attendance at the tutorials is expected.

No. Posted Tutorial Download
1 17.04.2013 26.04.2013 PDF
2 08.05.2013 17.05.2013 PDF
3 22.05.2013 31.05.2013 PDF
4 05.06.2013 14.06.2013 PDF
5 19.06.2013 05.07.2013 PDF
6 03.07.2013 12.07.2013 PDF

Textbooks

The lecture does not follow a specific text book. The following text books contain general information on graph algorithms.

Further Information