19214701
Vorlesung
SoSe 16: Diskrete Mathematik I
Tibor Szabo
Zusätzl. Angaben / Voraussetzungen
Target group:
BMS students, Master and Bachelor students
Kommentar
Content:
Selection from the following topics:
- Counting (basics, double counting, Pigeonhole Principle, recursions, generating functions, Inclusion-Exclusion, inversion, Polya theory)
- Discrete Structures (graphs, set systems, designs, posets, matroids)
- Graph Theory (trees, matchings, connectivity, planarity, colorings)
- Algorithms (asymptotic running time, BFS, DFS, Dijkstra, Greedy, Kruskal, Hungarian, Ford-Fulkerson)
Literaturhinweise
- M. Aigner: Diskrete Mathematik
- R. Diestel: Graph Theory
- J. Matousek, J. Nesetril: An invitation to Discrete Mathematics
- D. West: Introduction to Graph Theory
28 Termine
Zusätzliche Termine
Di, 26.07.2016 08:00 - 12:00Klausur
Fr, 09.09.2016 11:00 - 13:00
Klausureinsicht
Mi, 12.10.2016 08:00 - 12:00
Nachklausur
Regelmäßige Termine der Lehrveranstaltung
Di, 19.04.2016 14:00 - 16:00
Di, 26.04.2016 14:00 - 16:00
Di, 03.05.2016 14:00 - 16:00
Di, 10.05.2016 14:00 - 16:00
Di, 17.05.2016 14:00 - 16:00
Di, 24.05.2016 14:00 - 16:00
Di, 31.05.2016 14:00 - 16:00
Di, 07.06.2016 14:00 - 16:00
Di, 14.06.2016 14:00 - 16:00
Di, 21.06.2016 14:00 - 16:00
Di, 28.06.2016 14:00 - 16:00
Di, 05.07.2016 14:00 - 16:00
Di, 12.07.2016 14:00 - 16:00
Di, 19.07.2016 14:00 - 16:00
Mi, 20.04.2016 14:00 - 16:00
Mi, 27.04.2016 14:00 - 16:00
Mi, 04.05.2016 14:00 - 16:00
Mi, 11.05.2016 14:00 - 16:00
Mi, 18.05.2016 14:00 - 16:00
Mi, 25.05.2016 14:00 - 16:00
Mi, 01.06.2016 14:00 - 16:00
Mi, 08.06.2016 14:00 - 16:00
Mi, 15.06.2016 14:00 - 16:00
Mi, 22.06.2016 14:00 - 16:00
Mi, 29.06.2016 14:00 - 16:00
Mi, 06.07.2016 14:00 - 16:00
Mi, 13.07.2016 14:00 - 16:00
Mi, 20.07.2016 14:00 - 16:00
Content:
Selection from the following topics: Counting (basics, double counting, Pigeonhole Principle, recursions, generating functions, Inclusion-Exclusion, inversion, Polya ... Lesen Sie weiter