Course for international guest/part time students
- Faculty
- Faculty of Science
- Organization
- TTK Department of Operations Research
- Code
- kombal2u0um17em
- Title
- Combinatorial algorithms 2 (l)
- Usual semester
- Spring
- Published semester
- 2025/26/2
- ECTS
- 3
- Language
- en
- Learning outcomes
- Knowledge: getting familiar with the most important combinatorial algorithms Ability: to understand and use combinatorial algorithms Attitude: the need to extend the mathematical knowledge, to gain new analytic skills Autonomy and Responsibility: based on the gained knowledge in combinatorial algorithms, the students are able to decide which tools are the most suitable to solve applied problems
- Course content
- Network flows, Ford-Fulkerson algorithm, Edmonds-Karp algorithm, preflow algorithm. Circulations. Minimum cost flows. Applications of flows. Matchings: Edmonds algorithm, Gallai-Edmonds theorem. Factor-critical graphs, T-joins, f-factors. Minimum cost circulations.
- Assessment method
- exam
- Recommended bibliography
- Frank: Connections in Combinatorial Optimization. Oxford University Press, 2011, Oxford Lecture Series in Mathematics and its Applications, 38.