Fortgeschrittene Netzwerk- und Graph-Algorithmen

What it is about

You deepen knowledge of graph and network algorithms: the focus is on centrality measures, density measurement algorithms in (sub)graphs, connectivity problems, and the assignment problem (Hungarian method). At the end you can analyze complex network problems, assess their complexity, and develop or apply suitable efficient algorithms.

What you will be able to do

• Evaluation of the complexity of specialized network problems
• Application of advanced graph algorithms to problem solving
• Analysis and evaluation of network properties (e.g. robustness, susceptibility to errors)
• Development of algorithms to optimize network parameters

What the module consists of

• VorlesungDelivery of theoretical content through lectures and presentations
• ÜbungDeepening through exercise sheets and discussions; individual feedback through corrections

Teaching method

• Vortrag/Präsentationfor introduction and presentation of the theoretical concepts
• Übungsblätter mit Besprechungfor active engagement with content and practice of algorithmic solutions; offers individual feedback
• Tafelarbeitfor illustration and step-by-step derivation of algorithms
• Folienfor structured preparation of the lecture content