Lehrinhalte
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.
Possible additional topics: coding/cryptography, more graph algorithms, e.g., min-cost flows
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
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.
Possible additional topics: coding/cryptography, more graph algorithms, e.g., min-cost flows
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
- Lehrende: Yann Disser
- Lehrende: Maximilian Gläser
Semester: ST 2021