Algorithmic Graph Structure TheoryModulbeschreibung #40321 / Version 1
- 6 LP
- Mündliche Prüfung
- Benotet
- Sommersemester
- Englisch, Deutsch
Diese Modulbeschreibung gilt nicht im aktuellen Semester (WiSe 2026/27).
Zur aktuellen Version (v3)
| Modul / Version | #40321 / #1 |
|---|---|
| Gültigkeit | WS 2014/15 – SS 2015 |
| Verfügbare Sprache(n) | Englisch, Deutsch |
| Leistungspunkte | 6 |
| Modulverantwortliche*r | Kreutzer, Stephan |
| Benotung | Benotet |
| Prüfungsform | Mündliche Prüfung |
| Lehrsprache(n) | Englisch, Deutsch |
Zugehörigkeit
| Fakultät | Fakultät IV |
|---|---|
| Institut | Institut für Softwaretechnik und Theoretische Informatik |
| Fachgebiet | 34352200 FG Logik und Semantik (LaS) |
Kontakt
| Sekretariat | EN 25 |
|---|---|
| Ansprechpartner*in | Pilz, Jana |
| E-Mail-Adresse | stephan.kreutzer@tu-berlin.de |
| Webseite | https://www.tu.berlin/en/las/studying-and-teaching/course-offer |
Lernergebnisse
Students completing the course will understand how structural information about instances to
computational problems can be used in the design of efficient algorithms. They will be familiar
with basic notions of graph decompositions and the algorithmic techniques facilitated to use
this additional information.
computational problems can be used in the design of efficient algorithms. They will be familiar
with basic notions of graph decompositions and the algorithmic techniques facilitated to use
this additional information.
Lehrinhalte
Many algorithmic problems on graphs are NP-hard and therefore there is good evidence that no efficient algorithms solving these problems on all graphs exist. Classical examples are
routing problems arising e.g. in integrated circuit layout and design, colouring problems in
scheduling applications or domination problems in facility location.
However, instances to these problems arising in practical applications may have more
”structure“ than general graphs, e.g. instances may be “hierarchical” or “tree-like”. Using this
additional structural information may help in designing efficient algorithms for solving
problems in instances of this form.
A particularly good example are instances which are planar graphs, i.e. graphs that can be
drawn without crossing edges. Planar graphs arise for instance in routing applications, as
many road or train maps are nearly planar. It turns out that if the input instance is planar, or a
tree, then many hard problems become tractable.
In this course we will study methods for solving algorithmic problems on restricted classes of
graphs. The most important cases will be planar graphs and graph classes defined by the
concept of bounded tree-width. We will then extend this to even more general classes of
graphs.
The focus of this lecture is to introduce the structural properties of graphs that can be
employed in the design of efficient algorithms and to present the algorithmic techniques
needed for this.
routing problems arising e.g. in integrated circuit layout and design, colouring problems in
scheduling applications or domination problems in facility location.
However, instances to these problems arising in practical applications may have more
”structure“ than general graphs, e.g. instances may be “hierarchical” or “tree-like”. Using this
additional structural information may help in designing efficient algorithms for solving
problems in instances of this form.
A particularly good example are instances which are planar graphs, i.e. graphs that can be
drawn without crossing edges. Planar graphs arise for instance in routing applications, as
many road or train maps are nearly planar. It turns out that if the input instance is planar, or a
tree, then many hard problems become tractable.
In this course we will study methods for solving algorithmic problems on restricted classes of
graphs. The most important cases will be planar graphs and graph classes defined by the
concept of bounded tree-width. We will then extend this to even more general classes of
graphs.
The focus of this lecture is to introduce the structural properties of graphs that can be
employed in the design of efficient algorithms and to present the algorithmic techniques
needed for this.
Modulbestandteile
Pflichtbereich
Die folgenden Veranstaltungen sind für das Modul obligatorisch:
| Lehrveranstaltungen | Art | Nummer | Turnus | Sprache | SWS | VVZ |
|---|---|---|---|---|---|---|
| Algorithmic Graph Structure Theory (Math) | Vorlesung | 0432 L675 | Sommersemester | – | 4 | ISIS |
Arbeitsaufwand und Leistungspunkte
Algorithmic Graph Structure Theory (Math) (Vorlesung)
| Aufwandbeschreibung | Multiplikator | Stunden | Gesamt |
|---|---|---|---|
| Präsenzzeit | 15 | 4 h | 60 h |
| Prüfungsvorbereitung | 1 | 30 h | 30 h |
| Vor-/Nachbereitung | 15 | 6 h | 90 h |
| 180 h | |||
Der Aufwand des Moduls summiert sich zu 180 Stunden. Damit umfasst das Modul 6 Leistungspunkte.
Beschreibung der Lehr- und Lernformen
The course consists of a flexible mix of lectures and exercise classes. In addition to regular
homework students will be given one more substantial exercise as a mini project over the
course.
homework students will be given one more substantial exercise as a mini project over the
course.
Voraussetzungen für die Teilnahme / Prüfung
Wünschenswerte Voraussetzungen für die Teilnahme an den Lehrveranstaltungen:
Participants should have a strong interest in theoretical computer science, discrete
mathematics or algorithmic graph theory.
The course is self-contained in the sense that all relevant algorithmic and graph theoretical
concepts will be introduced in the lectures. Basic knowledge of graph theory and graph
algorithms may be useful but is not a requirement.
mathematics or algorithmic graph theory.
The course is self-contained in the sense that all relevant algorithmic and graph theoretical
concepts will be introduced in the lectures. Basic knowledge of graph theory and graph
algorithms may be useful but is not a requirement.
Verpflichtende Voraussetzungen für die Modulprüfungsanmeldung:
Dieses Modul hat keine Prüfungsvoraussetzungen.
Abschluss des Moduls
| Benotung | Benotet |
|---|---|
| Prüfungsform | Mündliche Prüfung |
| Sprache | Englisch, Deutsch |
Prüfungsbeschreibung (Abschluss des Moduls)
Oral examination
For admission to the oral examination students need to pass the homework set during the
course.
For admission to the oral examination students need to pass the homework set during the
course.
Dauer des Moduls
Für Belegung und Abschluss des Moduls ist folgende Semesteranzahl veranschlagt: 1 Semester.
Dieses Modul kann in folgenden Semestern begonnen werden: Sommersemester.
Maximale teilnehmende Personen
Dieses Modul ist nicht auf eine Anzahl Studierender begrenzt.
Anmeldeformalitäten
Registration for the module is via the ISIS System. To sign up for the exam follow the standard procedures in your curriculum.
Literaturhinweise, Skripte
Skript in Papierform
verfügbar
Skript in elektronischer Form
verfügbar
Empfohlene Literatur
- Lecture notes on paper: nein Lectures notes in electronic form: ja Literature: References to additional literature will be given during the lectures.
Zugeordnete Studiengänge
Dieses Modul findet in keinem Studiengang Verwendung.
Wahlpflichtmodul in the Master in Computer Science (“Reliable Systems” and “Intelligent
Systems”) and Master in Mathematics.
Wahlpflichtmodul Bachelor Computer Science.
Wahlpflichtmodul Bachelor Mathematics.
Systems”) and Master in Mathematics.
Wahlpflichtmodul Bachelor Computer Science.
Wahlpflichtmodul Bachelor Mathematics.
Sonstiges
The lecture can be given is English or German depending on students preferences. The
default is English.
default is English.