Skip to content
Technische Universität Berlin Deutsch
Course catalog and module transfer system

Algorithmic Graph Structure TheoryModule description #40321 / Version 1

← Module page Deutsche Fassung
This module description is not valid in the current semester (Winter semester 2026/27). Current version (v3)
Module / Version#40321 / #1
ValidityWS 2014/15 – SS 2015
Available language(s)English, German
Credit points6
Person responsible for the moduleKreutzer, Stephan
GradingGraded
Exam formatOral exam
Language(s) of instructionEnglish, German

Affiliation

FacultyFakultät IV
InstituteInstitut für Softwaretechnik und Theoretische Informatik
Academic chair34352200 FG Logik und Semantik (LaS)

Contact

OfficeEN 25
Contact personPilz, Jana
E-mail addressstephan.kreutzer@tu-berlin.de
Websitehttps://www.tu.berlin/en/las/studying-and-teaching/course-offer

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 notions of graph decompositions and the 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.

Module components

Compulsory area

The following courses are mandatory for this module:

CoursesTypeNumberFrequencyLanguageHours per weekCourse catalog
Algorithmic Graph Structure Theory (Math)Lecture0432 L675 Summer semester–4 ISIS

Workload and credit points

Algorithmic Graph Structure Theory (Math) (Lecture)

Workload descriptionMultiplierHoursTotal
Präsenzzeit154 h60 h
Prüfungsvorbereitung130 h30 h
Vor-/Nachbereitung156 h90 h
180 h

The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.

Description of teaching and learning methods

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.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

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.

Mandatory requirements for the module examination registration:

This module has no examination requirements.

Completion of the module

GradingGraded
Exam formatOral exam
LanguageEnglish, German

Exam description

Oral examination
For admission to the oral examination students need to pass the homework set during the
course.

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: Summer semester.

Maximum number of participants

This module is not limited to a number of students.

Registration procedures

Registration for the module is via the ISIS System. To sign up for the exam follow the standard procedures in your curriculum.

Recommended reading, lecture notes

Lecture notes

available

Electronic lecture notes

available

Recommended literature

  • Lecture notes on paper: nein Lectures notes in electronic form: ja Literature: References to additional literature will be given during the lectures.

Assigned programs

This module is not used in any program.

Wahlpflichtmodul in the Master in Computer Science (“Reliable Systems” and “Intelligent
Systems”) and Master in Mathematics.
Wahlpflichtmodul Bachelor Computer Science.
Wahlpflichtmodul Bachelor Mathematics.

Miscellaneous

The lecture can be given is English or German depending on students preferences. The
default is English.