Course Contents
Graph theory, growth of functions and asymptotic analysis of complexity, algorithms for spanning trees, shortest paths, matchings in bipartite graphs and flows in directed graphs, NP-completeness, searching and sorting.
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. Matoušek, J. Nešetril, Diskrete Mathematik. Eine Entdeckungsreise, Springer, 2002.
Preconditions
recommended: Analysis, Linear Algebra
Online Offerings
moodle
Graph theory, growth of functions and asymptotic analysis of complexity, algorithms for spanning trees, shortest paths, matchings in bipartite graphs and flows in directed graphs, NP-completeness, searching and sorting.
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. Matoušek, J. Nešetril, Diskrete Mathematik. Eine Entdeckungsreise, Springer, 2002.
Preconditions
recommended: Analysis, Linear Algebra
Online Offerings
moodle
- Lehrende: Nils Mosis
- Lehrende: Andreas Paffenholz
Semester: Verão 2023