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 March 4th, at 2pm via Zoom.

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

ECTS-Breakdown: 3 ECTS = 75 hours

25 h lecture
29 h solving exercise sheets
20.5 h exam preparation
  .5 h oral exam
----
75 h overall

Exercise + oral exams

Algorithms and Datastructure

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