During the last 30 years many different distributed algorithms color the vertices or edges of graphs have been published. In this course we will
cover many of the classic algorithms but also many very recently published algorithms.
This is an algorithmic/mathematical course and the course will be held in English.
There will be no final exam. The grade will be composed by two components: A final project (submissions in pairs) (80 percent of the grade) and submitted written lecture notes (Latex) (each attendee should write lecture notes for a single lecture)
Credit points: 2.0
Prerequisits: Data Structures, Algorithms, Introduction to Probability, Distributed Graph Algorithms