DE
Modul
Algorithms for Planar Graphs [M-INFO-101220]
Credits
5Recurrence
Jedes SommersemesterDuration
1 SemesterLanguage
GermanLevel
3Version
1Responsible
Organisation
- KIT-Fakultät für Informatik
Bricks
| Identifier | Name | LP |
|---|---|---|
| T-INFO-101986 | Algorithms for Planar Graphs | 5 |
Content
A planar graph is defined as a graph that can be drawn in the plane such that no edges intersect. Planar graphs have many interesting properties that can be used to solve several problems in a particularly simple, fast and elegant way. In addition, some problems that are (NP-)hard in general graphs can be efficiently solved in planar graphs. The lecture presents a selection of these problems and corresponding algorithmic approaches.
Workload
approx. 150 h