|
Instructors: Dipl.-Math. Christian Brandenburg; Dr. rer. nat. Andreas Paffenholz; Ph. D. Fredrik Strömberg
Event type:
Lecture & Exercise
Org-unit: Dept. 04 - Mathematics
Displayed in timetable as:
Alg. Disk. Math.
Subject:
Crediting for:
Hours per week:
3
Credits:
4,5
Language of instruction:
German and English
Min. | Max. participants:
- | 192
Course Contents:
Intoduction to Graph Theory:
basic notions,
Eulerian graphs, trees and spanning trees, shortest paths,
matchings and flow algorithms
Searching and sorting
Growth of functions and asymptotic analysis of complexity
Coding and cryptography: Huffman coding, RSA algorithm
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.
J. Harris, J. L. Hirst, and M.l J. Massinghoff Combinatorics and Graph Theory, Springer 2008
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Second edition, Addison-Wesley, Reading, MA, 1994.
J. Matousek, J. Nesetril, Diskrete Mathematik. Eine Entdeckungsreise, Springer, 2002.
Preconditions:
Expected Number of Participants:
Further Grading Information:
Official Course Description:
|
