After successful completion of the course, students are able to...

• explain advanced concepts and structures in graph theory
• describe and design algorithms for interesting graph problems
• model and analyze graph problems from real-world applications

The lecture discusses algorithmic aspects in graph theory from a theoretical point of view.

Potential topics include

• Review of important graph notion and concepts
• Recognition algorithms of prominent graph classes and related problems
• Problems related to planar graphs
• Problems related to sparse graphs or dense graphs
• Problems on directed graphs
• Different relevant matching concepts under preferences

Lecture + exercise units

First meeting on October 3rd, at 2pm lecture room FAV Hörsaal 2.

For general questions, please send an email to agt@ac.tuwien.ac.at

ECTS-Breakdown: 4.5 ECTS = 110 hours

26  h lecture
61  h solving exercise sheets
22  h exam preparation
  1  h oral exam
----
110 h overall

Exercise + oral exams

Algorithms and Datastructure

Good to have heard: basic knowledge of graph theory, algorithmics