VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

251-1408-00L 5 Credits BSC , DS , MSC D-MATH , D-INFK
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.

Graphs and Algorithms

Lecturers & Examiners: Prof. Dr. Angelika Steger, Dr. Martin Marciniszyn
VVZ CR n/a

Last Updated: 2026-02-05 15:19:55

Abstract

Connectivity (block decomposition, Menger), Matching for bipartite graphs (Hall, König, Hopcroft-Karp algorithm, Hungarian method), Hamilton cycles (Dirac), Planar graphs (Euler’s formula, 5-coloring, planarity testing (in quadratic time)), Graph Coloring (Greedy, Brooks, Vizing, Hadwiger’s conjecture), Extremal Graph Theory (Ramsey, Turan)

General Information

Language
English
Levels
BSC , DS , MSC
Frequency
Yearly recurring

Examination

Type
end-of-semester examination

Course Components

Type Title Time & Place Hours
lecture Graphs and Algorithms
  • Thu 08:15-10:00 (CAB G 61)
2 h weekly
exercise Graphs and Algorithms
  • Thu 10:15-11:00 (CAB G 61)
1 h weekly

Offered In