040968 UK Graph Algorithms and Network Flows (MA) (2024S)
Continuous assessment of course work
Labels
ON-SITE
Registration/Deregistration
Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).
- Registration is open from Mo 12.02.2024 09:00 to We 21.02.2024 12:00
- Deregistration possible until Th 14.03.2024 23:59
Details
max. 50 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
Wednesday
06.03.
13:15 - 14:45
Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
13.03.
13:15 - 14:45
Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
20.03.
13:15 - 14:45
Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
10.04.
13:15 - 14:45
Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
17.04.
13:15 - 14:45
Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
24.04.
13:15 - 14:45
Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
N
Wednesday
08.05.
13:15 - 14:45
Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
15.05.
13:15 - 14:45
Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
22.05.
13:15 - 14:45
Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
29.05.
13:15 - 14:45
Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
05.06.
13:15 - 14:45
Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
12.06.
13:15 - 14:45
Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
19.06.
13:15 - 14:45
Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
26.06.
13:15 - 14:45
Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
Information
Aims, contents and method of the course
Assessment and permitted materials
Solving assigned exercises and uploading them in Moodle. final oral exam.
Minimum requirements and assessment criteria
A minimum of 60% corretly solved exercised + oral exam
Examination topics
what has been presented. Handouts will be available.
Reading list
- T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, 1990
- D. Jungnickel: Graphen, Netzwerke und Algorithmen, BI Wissenschaftsverlag, 3. Auflage, 1994
- J. Bang-Jensen, G. Gutin: Digraphs: Theory, Algorithms and Applications, Springer, 2001
- R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, 1993
- D. Easley, J. Kleinberg, Networks, Crowds, and Markets: Reasoning About a Highly Connected World, Cambridge University Press, 2010
- E. Tardos, J. Kleinberg, Algorithm Design, Addison Wesley, 2005
- D. Jungnickel: Graphen, Netzwerke und Algorithmen, BI Wissenschaftsverlag, 3. Auflage, 1994
- J. Bang-Jensen, G. Gutin: Digraphs: Theory, Algorithms and Applications, Springer, 2001
- R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, 1993
- D. Easley, J. Kleinberg, Networks, Crowds, and Markets: Reasoning About a Highly Connected World, Cambridge University Press, 2010
- E. Tardos, J. Kleinberg, Algorithm Design, Addison Wesley, 2005
Association in the course directory
Last modified: We 28.02.2024 10:25
Characteristic parameters of networks, such as diameter, centrality and edge weights.Complexity of graphtheoretic AlgorithmsApplications in routing, network design, activity planning, systemic risk, social networks