Digital Teaching
flipped classroom (lecture videos live session with quizzes)
Lehrinhalte
algorithms and asymptotic complexity, search and sorting, graph theory, graph algorithms, spanning trees, shortest paths, matchings in bipartite graphs, flows in directed graphs, NP-completeness.
Literature
M. Aigner, Diskrete Mathematik, 5. Auflage, Vieweg, 2003.
T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein: Introduction to algorithms, 2. Auflage, B&T, 2001.
B. Korte, J. Vygen: Combinatorial Optimization, Springer 2012.
J. Matouek, J. Neetril, Diskrete Mathematik. Eine Entdeckungsreise, Springer, 2002.
Voraussetzungen
recommended: Analysis, Linear Algebra
Online-Angebote
moodle
flipped classroom (lecture videos live session with quizzes)
Lehrinhalte
algorithms and asymptotic complexity, search and sorting, graph theory, graph algorithms, spanning trees, shortest paths, matchings in bipartite graphs, flows in directed graphs, NP-completeness.
Literature
M. Aigner, Diskrete Mathematik, 5. Auflage, Vieweg, 2003.
T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein: Introduction to algorithms, 2. Auflage, B&T, 2001.
B. Korte, J. Vygen: Combinatorial Optimization, Springer 2012.
J. Matouek, J. Neetril, Diskrete Mathematik. Eine Entdeckungsreise, Springer, 2002.
Voraussetzungen
recommended: Analysis, Linear Algebra
Online-Angebote
moodle
- Lehrende: Yann Disser
- Lehrende: David Michael Weckbecker
Semester: Verão 2022