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
,
WBZ
D-BSSE
,
D-INFK
,
D-MATH
Graphs & Algorithms: Advanced Topics
Last Updated: 2026-02-05 15:24:49
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 , WBZ
- Frequency
- Yearly recurring
Examination
- Type
- end-of-semester examination
Oral exam at the end of the semester. Duration: 20 minutes per candidate
Course Components
| Type | Title | Time & Place | Hours |
|---|---|---|---|
| lecture | Graphs & Algorithms: Advanced Topics |
|
2 h weekly |
| exercise | Graphs & Algorithms: Advanced Topics |
|
2 h weekly |