Structural Graph TheoryModule description #40461 / Version 2
- 9 CP
- Oral exam
- Graded
- Winter and summer semester
- English, German
| Module / Version | #40461 / #2 |
|---|---|
| Validity | Since SS 2017 |
| Available language(s) | English, German |
| Credit points | 9 |
| Person responsible for the module | Kreutzer, Stephan |
| Grading | Graded |
| Exam format | Oral exam |
| Language(s) of instruction | English, German |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34352200 FG Logik und Semantik (LaS) |
Contact
| Office | TEL 7-3 |
|---|---|
| Contact person | Not specified |
| E-mail address | stephan.kreutzer@tu-berlin.de |
| Website | Not specified |
Learning outcomes
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.
algorithmic techniques facilitated to use this additional information.
Content
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.
Module components
Compulsory area
The following courses are mandatory for this module:
Workload and credit points
Graph Decompositions and Applications in Algorithmics and Logic (CS) (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| 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) (Exercise)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 4 h | 60 h |
| 90 h | |||
The workload of the module adds up to 270 hours. The module therefore comprises 9 credit points.
Description of teaching and learning methods
The course consists of a flexible mix of lectures and exercise classes.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
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.
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Oral exam |
| Type of portfolio examination | 100 points in total |
| Language | English, German |
| Duration/Extent | ca. 40 Minuten |
Exam description
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.
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Winter and summer semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
To enlist for this course, see http://www.las.tu-berlin.de.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available
Recommended literature
- 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.
Assigned programs
This module version is used in the following programs:
| Program / program version | Semester(s) | Curriculum component |
|---|---|---|
| Computer Engineering Computer Engineering (M. Sc.) - StuPO 2015 | SS 2025 | Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing |
| WS 2025/26 | Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing | |
| SS 2026 | Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing | |
| WS 2026/27 | Wahlpflichtbereich › Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing | |
| Computer Science (Informatik) Computer Science (Informatik) (M. Sc.) - StuPO 2015 | SS 2025 | Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing |
| WS 2025/26 | Studiengebiete › Grundlagen der Informatik / Foundations of Computing | |
| SS 2026 | Studiengebiete › Grundlagen der Informatik / Foundations of Computing | |
| WS 2026/27 | Wahlpflichtbereich › Studiengebiet › Grundlagen der Informatik / Foundations of Computing | |
| Electrical Engineering Electrical Engineering (M. Sc.) - StuPO 2015 | SS 2025 | Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing |
| WS 2025/26 | Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing | |
| SS 2026 | Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing | |
| WS 2026/27 | Wahlpflichtbereich › Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing |
Master in Mathematics.
Miscellaneous
The lecture can be given is English or German depending on students preferences. The default is English.