VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.
251-1409-00L
6
Credits
BSC
,
DS
,
MSC
D-BSSE
,
D-INFK
,
D-MATH
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.
Graphs & Algorithms: Advanced Topics
Lecturers & Examiners:
Prof. Dr. Tibor Szabo
Last Updated: 2026-02-05 15:14:33
Abstract
k-trees, matchings (Tutte's Theorem, Edmonds' Algorithm), network flows(Goldberg-Tarjan Algorithm), planar graphs (Kuratowski's Theorem,Lipton-Tarjan separators), stable matchings, list coloring(Galvin's Theorem), extremal graph theory (Erdos-Stone Theorem)
General Information
- Language
- English
- Levels
- BSC , DS , MSC
- Frequency
- Yearly recurring
Examination
- Type
- session examination
- Mode
- oral 30 minutes
Course Components
| Type | Title | Time & Place | Hours |
|---|---|---|---|
| lecture | Graphs & Algorithms: Advanced Topics |
|
2 h weekly |
| exercise | Graphs & Algorithms: Advanced Topics |
|
2 h weekly |