Graph Decompositions and Applications in Algorithmics and LogicModulbeschreibung #40461 / Version 1
- 9 LP
- Mündliche Prüfung
- Benotet
- Winter- und Sommersemester
- Englisch, Deutsch
Diese Modulbeschreibung gilt nicht im aktuellen Semester (WiSe 2026/27).
Zur aktuellen Version (v2)
| Modul / Version | #40461 / #1 |
|---|---|
| Gültigkeit | SS 2014 – WS 2016/17 |
| Verfügbare Sprache(n) | Englisch, Deutsch |
| Leistungspunkte | 9 |
| 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 | TEL 7-3 |
|---|---|
| Ansprechpartner*in | Keine Angabe |
| E-Mail-Adresse | stephan.kreutzer@tu-berlin.de |
| Webseite | Keine Angabe |
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 nations of graph decompositions and the
algorithmic techniques facilitated to use this additional information.
The course is principally designed to impart: Technical skills 60 x method skills 30 x system skills 0 x social skills 10 x
algorithmic techniques facilitated to use this additional information.
The course is principally designed to impart: Technical skills 60 x method skills 30 x system skills 0 x social skills 10 x
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.
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:
Arbeitsaufwand und Leistungspunkte
Graph Decompositions and Applications in Algorithmics and Logic (CS) (Integrierte Veranstaltung)
| Aufwandbeschreibung | Multiplikator | Stunden | Gesamt |
|---|---|---|---|
| Präsenzzeit | 15 | 4 h | 60 h |
| Vor-/Nachbereitung | 15 | 8 h | 120 h |
| 180 h | |||
Graph Decompositions and Applications in Algorithmics and Logic (CS) (Übung)
| Aufwandbeschreibung | Multiplikator | Stunden | Gesamt |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 4 h | 60 h |
| 90 h | |||
Der Aufwand des Moduls summiert sich zu 270 Stunden. Damit umfasst das Modul 9 Leistungspunkte.
Beschreibung der Lehr- und Lernformen
The course consists of a flexible mix of lectures and exercise classes.
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 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.
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 in both parts of the module.
For admission to the oral examination students need to pass the homework in both parts of the module.
Dauer des Moduls
Für Belegung und Abschluss des Moduls ist folgende Semesteranzahl veranschlagt: 1 Semester.
Dieses Modul kann in folgenden Semestern begonnen werden: Winter- und Sommersemester.
Maximale teilnehmende Personen
Die maximale Teilnehmerzahl beträgt 30.
Anmeldeformalitäten
To enlist for this course, see http://www.las.tu-berlin.de.
Literaturhinweise, Skripte
Skript in Papierform
nicht verfügbar
Skript in elektronischer Form
verfügbar
Empfohlene Literatur
- Lecture notes on paper ja nein x Lectures notes in electronic form ja x nein Recommended Reading References to additional literature will be given during the lectures.
Zugeordnete Studiengänge
Dieses Modul findet in keinem Studiengang Verwendung.
Master in Mathematics.
Sonstiges
The lecture can be given is English or German depending on students preferences. The default is English.